Table Of Content

Discrete Mathematics Volume 233, Numbers 1-3, 28 April 2001 Contents Foreword M. Fiedler, J. Kratochvil and J. Nesétril Contribution J. NeSetril, E. Milkova and H. NeSetrilova Otakar Borivka on minimum spanning tree problem Translation of both the 1926 papers, comments, history Graph theory L. Boza, M.T. Davila, A.M arquez and R. Moyano Miscellaneous properties of embeddings of line, total and middle graphs H. Broersma and Z. Ryjacek Strengthening the closure concept in claw-free graphs R. Caha and V. Koubek Optimal embeddings of generalized ladders into hypercubes M.-c. Cai, E. Flandrin and H. Li On quasifactorability in graphs H. Enomoto Graph partition problems into cycles and paths D. Ferrero and C. Padroé New bounds on the diameter vulnerability of iterated line digraphs D. Froncéek On seed graphs with more than two components M. Harminc and R. Sotak Graphs with average labellings P. Hrnéiar and A. Haviar All trees of diameter five are graceful M. Knor and L’. Niepel Diameter in iterated path graphs A.V. Kostochka and D.R. Woodall Sparse sets in the complements of graphs with given girth M. Loebl and M. Matamala Some remarks on cycles in graphs and digraphs 175 R.J. Nowakowski and C.A. Whitehead Ordered graceful labellings of the 2-star 183 M. Tewes Pancyclic in-tournaments 193 M. Wozniak Note on compact packing of a graph 205 Colorings of graphs V. Barré On vertex neighborhood in minimal imperfect graphs 211 F. Havet Channel assignment and multicolouring of the induced subgraphs of the triangular lattice 219 C.C. Heckman and R. Thomas A new proof of the independence ratio of triangle-free cubic graphs 233 A. Kemnitz and M. Marangio Chromatic numbers of integer distance graphs 239 M. Kochol Stable dominating circuits in snarks 247 A. Kostochka, J. NeSetril and P. Smolikova Colorings and homomorphisms of degenerate and bounded degree graphs 257 J. NeSetril and X. Zhu Construction of sparse graphs with prescribed circular colorings 277 Topological graph theory R. Barbosa and B. Hartnell Characterization of Z,,-well-covered graphs for some classes of graphs 293 H. Crapo and P. Rosenstiehl On lacets and their manifolds 299 S.M. Hashemi Digraph embedding 321 S. Jendrol’ and H.-J. Voss Light subgraphs of multigraphs on compact 2-dimensional manifolds 329 M. Klesc The crossing numbers of Cartesian products of paths with 5-vertex graphs J. Matousek Lower bound on the minus-domination number J. Maxova and J. NeSetril On oriented path double covers B. Zmazek and J. Zerovnik On recognizing Cartesian graph bundles Author index to volume 233