Table Of Content

Discrete Mathematics Volume 251, Numbers 1-3, 28 May 2002 Contents Preface M. Hornak and S. Jendrol Contributions A.J. Berger Minimal reducible bounds in the lattice of additive hereditary graph properties A.J. Berger, |. Broere, S.J.T. Moagi and P. Mihok Meet- and join-irreducibility of additive hereditary properties of graphs M. Borowiecki and E. Sidorowicz Some extremal problems of graphs with local constraints S. Brandt A 4-colour problem for dense triangle-free graphs H.J. Broersma On some intriguing problems in hamiltonian graph theory—a survey J. Brousek Forbidden triples for hamiltonicity J. Brousek, R.J. Faudree and Z. Ryjacek A note on hamiltonicity of generalized net-free graphs of large diameter |. Gorgol and T. tuczak On induced Ramsey numbers F. Goring On 2-regular subgraphs in polyhedral graphs E. Hexel On light graphs in the family of 4-connected planar graphs M. Kleseé The crossing number of K; C3 M. Kouider and A. Marczyk On pancyclism in hamiltonian graphs Discrete Mathematics Volume 251, Numbers 1-3, 28 May 2002 Contents Preface M. Hornak and S. Jendrol Contributions A.J. Berger Minimal reducible bounds in the lattice of additive hereditary graph properties A.J. Berger, |. Broere, S.J.T. Moagi and P. Mihok Meet- and join-irreducibility of additive hereditary properties of graphs M. Borowiecki and E. Sidorowicz Some extremal problems of graphs with local constraints S. Brandt A 4-colour problem for dense triangle-free graphs H.J. Broersma On some intriguing problems in hamiltonian graph theory—a survey J. Brousek Forbidden triples for hamiltonicity J. Brousek, R.J. Faudree and Z. Ryjacek A note on hamiltonicity of generalized net-free graphs of large diameter |. Gorgol and T. tuczak On induced Ramsey numbers F. Goring On 2-regular subgraphs in polyhedral graphs E. Hexel On light graphs in the family of 4-connected planar graphs M. Kleseé The crossing number of K; C3 M. Kouider and A. Marczyk On pancyclism in hamiltonian graphs A. Pruchnewski On the domination number of a graph B. Randerath, |. Schiermeyer and M. Tewes Three-colourability and forbidden subgraphs. II: polynomial algorithms A. Recski Two matroidal families on the edge set of a graph Z. Skupien Hamiltonicity of planar cubic multigraphs Z. Tuza and M. Voigt A note on planar 5-list colouring: non-extendability at distance 4 M. Wozniak On cyclically embeddable (n,n—1)-graphs Author index to volume 251 > "ve \3