Volume 39, Number 1, January 2002

• 
  Paul N. Balister, Richard H. Schelp, Miklós Simonovits: A note on Ramsey size-linear graphs. 1-5
• 
  Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Even-hole-free graphs part I: Decomposition theorem. 6-49
• 
  Riste Skrekovski: On the critical point-arboricity graphs. 50-61
• 
  Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss: Connected (g, f)-factors. 62-75
• 
  Yaojun Chen, Feng Tian, Bing Wei: Codiameters of 3-connected 3-domination critical graphs. 76-85

Volume 39, Number 2, February 2002

• 
  Mike J. Grannell, Terry S. Griggs, Jozef Sirán: Recursive constructions for triangulations. 87-107
• 
  Jaroslav Nesetril: A rigid graph for every set. 108-110
• 
  Ken-ichi Kawarabayashi: K₄^--factor in a graph. 111-128
• 
  Wolfgang Mader: On Vertices of outdegree n in minimally n-connected digraphs. 129-144
• 
  Roland Häggkvist, Wolfgang Mader: Circuits through prescribed vertices in k-connected k-regular graphs. 145-163

Volume 39, Number 3, March 2002

• 
  Alexandr V. Kostochka, Michael Stiebitz: A list version of Dirac's theorem on the number of edges in colour-critical graphs. 165-177
• 
  Joel Foisy: Intrinsically knotted graphs. 178-187
• 
  Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota: Path factors in cubic graphs. 188-193
• 
  Béla Bollobás, Endre Szemerédi: Girth of sparse graphs. 194-200
• 
  Amir Pirnazar, Daniel Ullman: Girth and fractional chromatic number of planar graphs. 201-217

Volume 39, Number 4, April 2002

• 
  Yuansheng Yang, Jianhua Lin, Chunli Wang: Small regular graphs having the same path layer matrix. 219-221
• 
  Thomas Andreae: On disjoint configurations in infinite graphs. 222-229
• 
  Dan Ismailescu, Dan Stefanica: Minimizer graphs for a class of extremal problems. 230-240
• 
  Daniela Kühn: Forcing a K_r minor by high external connectivity. 241-264
• 
  Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata: Fan-type theorem for path-connectivity. 265-282

last updated on Thu May 23 04:26:59 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page