Discrete Mathematics, Volume 251

Volume 251, Number 1-3, May 2002

• Mirko Hornák, Stanislav Jendrol:
  Preface. 1-
  
• Amelie J. Berger:
  Minimal reducible bounds in the lattice of additive hereditary graph properties. 3-10
  
• Amelie J. Berger, Izak Broere, Samuel J. T. Moagi, Peter Mihók:
  Meet- and join-irreducibility of additive hereditary properties of graphs. 11-18
  
• Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
  Some extremal problems of graphs with local constraints. 19-32
  
• Stephan Brandt:
  A 4-colour problem for dense triangle-free graphs. 33-46
  
• Hajo Broersma:
  On some intriguing problems in hamiltonian graph theory--a survey. 47-69
  
• Jan Brousek:
  Forbidden triples for hamiltonicity. 71-76
  
• Jan Brousek, Ralph J. Faudree, Zdenek Ryjácek:
  A note on hamiltonicity of generalized net-free graphs of large diameter. 77-85
  
• Izolda Gorgol, Tomasz Luczak:
  On induced Ramsey numbers. 87-96
  
• Frank Göring:
  On 2-regular subgraphs in polyhedral graphs. 97-102
  
• Erhard Hexel:
  On light graphs in the family of 4-connected planar graphs. 103-107
  
• Marián Klesc:
  The crossing number of K_{2, 3}xC₃. 109-117
  
• Mekkia Kouider, Antoni Marczyk:
  On pancyclism in hamiltonian graphs. 119-127
  
• Anja Pruchnewski:
  On the domination number of a graph. 129-136
  
• Bert Randerath, Ingo Schiermeyer, Meike Tewes:
  Three-colourability and forbidden subgraphs. II: polynomial algorithms. 137-153
  
• András Recski:
  Two matroidal families on the edge set of a graph. 155-162
  
• Zdzislaw Skupien:
  Hamiltonicity of planar cubic multigraphs. 163-168
  
• Zsolt Tuza, Margit Voigt:
  A note on planar 5-list colouring: non-extendability at distance 4. 169-172
  
• Mariusz Wozniak:
  On cyclically embeddable (n, n-1)-graphs. 173-179