Journals in DBLP

Graphs and Combinatorics
2004, volume: 20, number: 2

1. Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia
   A Problem on Hinged Dissections with Colours. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:145-159 [Journal]
   
2. Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj
   Configurations in 4-Cycle Systems. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:161-179 [Journal]
   
3. Weiting Cao, Michael J. Pelsmajer
   The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:181-183 [Journal]
   
4. Yubao Guo, Lutz Volkmann
   Extendable Cycles in Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:185-190 [Journal]
   
5. Mirko Hornák, Stefan Pcola, Mariusz Wozniak
   On the Achromatic Index of for a Prime q. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:191-203 [Journal]
   
6. Jesper Jansson, Takeshi Tokuyama
   Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:205-222 [Journal]
   
7. Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
   A Note on Convex Decompositions of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:223-231 [Journal]
   
8. James G. Oxley, Haidong Wu
   The 3-Connected Graphs with Exactly Three Non-Essential Edges. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:233-246 [Journal]
   
9. Gelasio Salazar, Edgardo Ugalde
   An Improved Bound for the Crossing Number of C _mC _n: a Self-Contained Proof Using Mostly Combinatorial Arguments. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2004, v:20, n:2, pp:247-253 [Journal]
   
10. Jozef Skokan, Lubos Thoma
    Bipartite Subgraphs and Quasi-Randomness. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:255-262 [Journal]
    
11. A. Volgenant, C. W. Duin
    On Steiner Versions of (bi)Connectivity in Network Problems. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:263-273 [Journal]
    
12. Xiao-Dong Zhang, Stanislaw Bylka
    Disjoint Triangles of a Cubic Line Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:275-280 [Journal]
    
13. Igor E. Zverovich
    A Characterization of Domination Reducible Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:281-289 [Journal]