Graphs and Combinatorics, Volume 20

Volume 20, Number 1, March 2004

• Bert Randerath, Ingo Schiermeyer:
  Vertex Colouring and Forbidden Subgraphs - A Survey. 1-40
  Electronic Edition (link) BibTeX
• Marco Buratti:
  Existence of 1-Rotational k-Cycle Systems of the Complete Graph. 41-46
  Electronic Edition (link) BibTeX
• John S. Caughman IV:
  Bipartite Q-Polynomial Distance-Regular Graphs. 47-57
  Electronic Edition (link) BibTeX
• Scott Hirschman, Victor Reiner:
  Note on the Pfaffian Matrix-Tree Theorem. 59-63
  Electronic Edition (link) BibTeX
• Hossein Hajiabolhassan, Xuding Zhu:
  Sparse H-Colourable Graphs of Bounded Maximum Degree. 65-71
  Electronic Edition (link) BibTeX
• Tetsuji Katahira:
  Infinite Series of Triangulations on Closed Surfaces with Vertex Covers of Given Degree. 73-78
  Electronic Edition (link) BibTeX
• Seog-Jin Kim, Kittikorn Nakprasit:
  On the Chromatic Number of the Square of the Kneser Graph K(2 k+1, k). 79-90
  Electronic Edition (link) BibTeX
• Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal:
  Pancyclicity of Strong Products of Graphs. 91-104
  Electronic Edition (link) BibTeX
• Anna de Mier, Marc Noy:
  On Graphs Determined by Their Tutte Polynomials. 105-119
  Electronic Edition (link) BibTeX
• Michael J. Pelsmajer:
  Maximum Induced Linear Forests in Outerplanar Graphs. 121-129
  Electronic Edition (link) BibTeX
• Philippe Pitteloud:
  Chromatic Polynomials and the Symmetric Group. 131-144
  Electronic Edition (link) BibTeX

Volume 20, Number 2, June 2004

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

Volume 20, Number 3, August 2004

• Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
  Generalizing Pancyclic and k-Ordered Graphs. 291-309
  Electronic Edition (link) BibTeX
• Yubin Gao, Yanling Shao:
  The Number of Negative Entries in a Sign Pattern Allowing Orthogonality. 311-317
  Electronic Edition (link) BibTeX
• Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
  Random Hypergraph Processes with Degree Restrictions. 319-332
  Electronic Edition (link) BibTeX
• Robert E. Jamison, Douglas B. West:
  On Pattern Ramsey Numbers of Graphs. 333-339
  Electronic Edition (link) BibTeX
• MingChu Li:
  Hamiltonian Connected Claw-Free Graphs. 341-362
  Electronic Edition (link) BibTeX
• Hirobumi Mizuno, Iwao Sato:
  Some L-Function of a Regular Covering of a Graph. 363-375
  Electronic Edition (link) BibTeX
• A. Muthusamy:
  On Resolvable Multipartite G-Designs. 377-382
  Electronic Edition (link) BibTeX
• Stavros D. Nikolopoulos, Charis Papadopoulos:
  The Number of Spanning Trees in K _n-Complements of Quasi-Threshold Graphs. 383-397
  Electronic Edition (link) BibTeX
• Bertran Steinsky:
  Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs. 399-411
  Electronic Edition (link) BibTeX
• Jichang Wu, Xueliang Li:
  Removable Edges in Longest Cycles of 4-Connected Graphs. 413-422
  Electronic Edition (link) BibTeX
• Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
  The Chromaticity of Certain Complete Multipartite Graphs. 423-434
  Electronic Edition (link) BibTeX

Volume 20, Number 4, November 2004

• Stephan Brandt, Mariusz Wozniak:
  On Cyclic Packing of a Tree. 435-442
  Electronic Edition (link) BibTeX
• Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger:
  Colorability of Planar Graphs with Isolated Nontriangular Faces. 443-446
  Electronic Edition (link) BibTeX
• Odile Favaron, Michael A. Henning:
  Paired-Domination in Claw-Free Cubic Graphs. 447-456
  Electronic Edition (link) BibTeX
• Anant P. Godbole, Joseph A. Johnson:
  Even 2 × 2 Submatrices of a Random Zero-One Matrix. 457-466
  Electronic Edition (link) BibTeX
• Wayne Goddard:
  Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. 467-483
  Electronic Edition (link) BibTeX
• Akira Hiraki, Jack H. Koolen:
  A Note on Regular Near Polygons. 485-497
  Electronic Edition (link) BibTeX
• Garth Isaak:
  Sum List Coloring Block Graphs. 499-506
  Electronic Edition (link) BibTeX
• Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien:
  Edge Decompositions of Multigraphs into 3-Matchings. 507-515
  Electronic Edition (link) BibTeX
• Antoni Marczyk:
  On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree. 517-529
  Electronic Edition (link) BibTeX
• Gaetano Quattrocchi, Zsolt Tuza:
  Partition of C ₄-Designs into Minimum and Maximum Number of P ₃-Designs. 531-540
  Electronic Edition (link) BibTeX
• C. A. Rodger:
  Hamilton Decomposable Graphs with Specified Leaves. 541-543
  Electronic Edition (link) BibTeX
• Ian M. Wanless:
  Cycle Switches in Latin Squares. 545-570
  Electronic Edition (link) BibTeX
• Igor E. Zverovich:
  A Solution to a Problem of Jacobson, Kézdy and Lehel. 571-577
  Electronic Edition (link) BibTeX