Graphs and Combinatorics, Volume 19

Volume 19, Number 1, March 2003

• Vasek Chvátal:
  Claude Berge: 5.6.1926-30.6.2002. 1-6
  
• Ronald J. Gould:
  Advances on the Hamiltonian Problem - A Survey. 7-52
  
• Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut:
  On the Volume of 4-Cycle Trades. 53-63
  
• Diane Donovan, Abdollah Khodkar, Anne Penfold Street:
  Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems. 65-89
  
• Fedor V. Fomin:
  Pathwidth of Planar and Line Graphs. 91-99
  
• Frédéric Havet:
  On Unavoidability of Trees with kLeaves. 101-110
  
• Xinmin Hou, Bolian Liu, Tianming Wang:
  An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. 111-119
  
• Hal A. Kierstead, Zsolt Tuza:
  Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. 121-129
  
• Jack H. Koolen, Vincent Moulton:
  Maximal Energy Bipartite Graphs. 131-135
  
• Anton Prowse, Douglas R. Woodall:
  Choosability of Powers of Circuits. 137-144
  

Volume 19, Number 2, June 2003

• Josep M. Brunat, Miguel Angel Fiol, Montserrat Maureso:
  Chromatic Automorphisms of Consecutive Digraphs. 145-159
  
• Mark N. Ellingham, Xiaoya Zha:
  Separating Cycles in Doubly Toroidal Embeddings. 161-175
  
• Graham Farr, Peter Eades:
  Skewness of Graphs with Small Cutsets. 177-194
  
• Akihide Hanaki:
  Representations of Association Schemes and Their Factor Schemes. 195-201
  
• Masaaki Harada, Patric R. J. Östergård:
  On the Classification of Self-Dual Codes over F₅. 203-214
  
• Volker Kaibel, Alexander Schwartz:
  On the Complexity of Polytope Isomorphism Problems. 215-230
  
• Hiroshi Kajimoto:
  An Extension of the Prüfer Code and Assembly of Connected Graphs from Their Blocks. 231-239
  
• Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
  The Linear 2-Arboricity of Planar Graphs. 241-248
  
• Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li:
  On Some Three-Color Ramsey Numbers. 249-258
  
• Taro Tokuda, Baoguang Xu, Jianfang Wang:
  Connected Factors and Spanning Trees in Graphs. 259-262
  
• Dominique de Werra:
  Variations on the Theorem of Birkhoff - von Neumann and Extensions. 263-278
  
• Igor E. Zverovich, Vadim E. Zverovich:
  Locally Well-Dominated and Locally Independent Well-Dominated Graphs. 279-288
  

Volume 19, Number 3, September 2003

• Peter Adams, Darryn E. Bryant, Saad El-Zanati, Heather Gavlas:
  Factorizations of the Complete Graph into C ₅-Factors and 1-Factors. 289-296
  
• Ahmed Ainouche, Ingo Schiermeyer:
  0-Dual Closures for Several Classes of Graphs. 297-307
  
• Irène Charon, Olivier Hudry:
  Links between the Slater Index and the Ryser Index of Tournaments. 309-322
  
• Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei:
  On Ranks of Matrices Associated with Trees. 323-334
  
• Charles J. Colbourn, Alexander Rosa:
  Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. 335-345
  
• Michael U. Gerber, Vadim V. Lozin:
  Robust Algorithms for the Stable Set Problem. 347-356
  
• John Gimbel:
  Some Remarks on the Convexity Number of a Graph. 357-361
  
• Akihide Hanaki:
  Characters of Association Schemes and Normal Closed Subsets. 363-369
  
• Akira Hiraki:
  The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph. 371-387
  
• Martin Kochol:
  A Theorem About Elementary Cuts and Flow Polynomials. 389-392
  
• Xuechao Li, Rong Luo:
  Edge Coloring of Embedded Graphs with Large Girth. 393-401
  
• T. S. Michael, William N. Traves:
  Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture. 403-411
  
• Ryuichi Mori, Atsuhiro Nakamoto, Katsuhiro Ota:
  Diagonal Flips in Hamiltonian Triangulations on the Sphere. 413-418
  
• Xuding Zhu:
  An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). 419-432
  

Volume 19, Number 4, November 2003

• Atif A. Abueida, Mike Daven:
  Multidesigns for Graph-Pairs of Order 4 and 5. 433-447
  
• Noga Alon, Simon Litsyn, Raphael Yuster:
  A Coding Theory Bound and Zero-Sum Square Matrices. 449-457
  
• David Austin, Heather Gavlas, Dave Witte:
  Hamiltonian Paths in Cartesian Powers of Directed Cycles. 459-466
  
• Robert Castelo, Nicholas C. Wormald:
  Enumeration of P ₄-Free Chordal Graphs. 467-474
  
• Jonathan David Farley:
  Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. 475-491
  
• Mariko Hagita, André Kündgen, Douglas B. West:
  Probabilistic Methods for Decomposition Dimension of Graphs. 493-503
  
• Iiro S. Honkala, Tero Laihonen:
  Codes for Identification in the King Lattice. 505-516
  
• Stanislav Jendrol, Peter J. Owens:
  Erratum. 517-518
  
• Hadi Kharaghani, Rouzbeh Torabi:
  On a Decomposition of Complete Graphs. 519-526
  
• Mirko Lepovic:
  On Integral Graphs Which Belong to the Class. 527-532
  
• Juan José Montellano-Ballesteros, Victor Neumann-Lara:
  A Linear Heterochromatic Number of Graphs. 533-536
  
• Christopher Parker, Peter Rowley:
  Subgroup-Chain Graphs. 537-545
  
• David A. Pike:
  Decycling Hypercubes. 547-550
  
• G. Sajith, Sanjeev Saxena:
  Local Nature of Brooks' Colouring for Degree 3 Graphs. 551-565
  
• Xin Wang, Yanxun Chang:
  Self-Converse Directed BIBDs with Block Size Four. 567-575