Graphs and Combinatorics, Volume 22

Volume 22, Number 1, April 2006

• Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
  Toughness in Graphs - A Survey. 1-35
  
• Adrian Dumitrescu, János Pach:
  Pushing Squares Around. 37-50
  
• Tomás Kaiser, Matthias Kriesell:
  On the Pancyclicity of Lexicographic Products. 51-58
  
• M. G. Karunambigai, A. Muthusamy:
  On Resolvable Multipartite G-Designs II. 59-67
  
• Manoel Lemos:
  Weight Distribution of the Bases of a Matroid. 69-82
  
• Linfan Mao, Yanpei Liu, Erling Wei:
  The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration. 83-101
  
• Dieter Rautenbach, Ingo Schiermeyer:
  Extremal Problems for Imbalanced Edges. 103-111
  
• Mohammad R. Salavatipour:
  Large Induced Forests in Triangle-Free Planar Graphs. 113-126
  
• Hua-ming Xing, Liang Sun, Xue-Gang Chen:
  Domination in Graphs of Minimum Degree Five. 127-143
  

Volume 22, Number 2, June 2006

• Joe Anderson, Haidong Wu:
  An Extremal Problem on Contractible Edges in 3-Connected Graphs. 145-152
  
• Armen S. Asratian:
  New Local Conditions for a Graph to be Hamiltonian. 153-160
  
• János Barát:
  Directed Path-width and Monotonicity in Digraph Searching. 161-172
  
• Adam Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett:
  Sum List Coloring Graphs. 173-183
  
• Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
  Planar Graphs, via Well-Orderly Maps and Trees. 185-202
  
• Bart De Bruyn:
  Distance-j-Ovoids in Regular Near 2d-Gons. 203-216
  
• Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
  On H-Linked Graphs. 217-224
  
• Peter Frankl, Norihide Tokushige:
  The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families. 225-231
  
• Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
  A Note on a Packing Problem in Transitive Tournaments. 233-239
  
• Gregory Gutin, Arash Rafiey, Anders Yeo:
  On n-partite Tournaments with Unique n-cycle. 241-249
  
• Lijun Ji:
  Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4. 251-260
  
• Kazuhiro Suzuki:
  A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph. 261-269
  
• Elkin Vumar:
  On the Circumference of 3-Connected Quasi-Claw-Free Graphs. 271-282
  
• Sun Yongqi, Yang Yuansheng, Xu Feng, Li Bingxi:
  New Lower Bounds on the Multicolor Ramsey Numbers R_r(C_2m). 283-288
  

Volume 22, Number 3, November 2006

• Michael O. Albertson, Bojan Mohar:
  Coloring Vertices and Faces of Locally Planar Graphs. 289-295
  
• Maria Axenovich, Ryan Martin:
  Sub-Ramsey Numbers for Arithmetic Progressions. 297-309
  
• Peter Danziger, Peter Dukes, Terry Griggs, Eric Mendelsohn:
  On the Intersection Problem for Steiner Triple Systems of Different Orders. 311-329
  
• Matthew Dean:
  On Hamilton Cycle Decomposition of 6-regular Circulant Graphs. 331-340
  
• Keith Edwards, Mirko Hornák, Mariusz Wozniak:
  On the Neighbour-Distinguishing Index of a Graph. 341-350
  
• David J. Grynkiewicz, Andrew Schultz:
  A Five Color Zero-Sum Generalization. 351-360
  
• Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
  Contractible Cliques in k-Connected Graphs. 361-370
  
• Haruhide Matsuda, Hajime Matsumura:
  On a k-Tree Containing Specified Leaves in a Graph. 371-381
  
• Dillon Mayhew:
  Circuits and Cocircuits in Regular Matroids. 383-389
  
• Jianguo Qian:
  Induced Matching Extendable Graph Powers. 391-398
  
• A. J. Radcliffe, Alex D. Scott:
  Reconstructing under Group Actions. 399-419
  
• Matej Stehlík:
  Minimal Connected tau-Critical Hypergraphs. 421-426
  
• Shung-Liang Wu, Hung-Lin Fu:
  A Note on Cyclic m-cycle Systems of K_r(m). 427-432