Fiedler, M. (ed.); Kratochvíl, J. (ed.); Nešetřil, J. (ed.) Graph theory. Papers from the 5th Czech-Slovak symposium on combinatorics, graph theory, algorithms and applications, Prague, Czech Republic, July 6–11, 1998. (English) Zbl 0986.00048 Discrete Math. 233, No. 1-3, 394 p. (2001). MSC: 00B25 05-06 PDFBibTeX XMLCite \textit{M. Fiedler} (ed.) et al., Discrete Math. 233, No. 1--3, 394 p. (2001; Zbl 0986.00048) Full Text: DOI
Zmazek, Blaž; Žerovnik, Janez On recognizing Cartesian graph bundles. (English) Zbl 0988.05065 Discrete Math. 233, No. 1-3, 381-391 (2001). Reviewer: Gregory Gutin (Egham) MSC: 05C60 PDFBibTeX XMLCite \textit{B. Zmazek} and \textit{J. Žerovnik}, Discrete Math. 233, No. 1--3, 381--391 (2001; Zbl 0988.05065) Full Text: DOI
Maxová, Jana; Nešetřil, Jaroslav On oriented path double covers. (English) Zbl 0983.05064 Discrete Math. 233, No. 1-3, 371-380 (2001). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{J. Maxová} and \textit{J. Nešetřil}, Discrete Math. 233, No. 1--3, 371--380 (2001; Zbl 0983.05064) Full Text: DOI
Matoušek, Jiří Lower bound on the minus-domination number. (English) Zbl 0986.05081 Discrete Math. 233, No. 1-3, 361-370 (2001). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05D40 PDFBibTeX XMLCite \textit{J. Matoušek}, Discrete Math. 233, No. 1--3, 361--370 (2001; Zbl 0986.05081) Full Text: DOI
Klešč, Marián The crossing numbers of Cartesian products of paths with 5-vertex graphs. (English) Zbl 0983.05027 Discrete Math. 233, No. 1-3, 353-359 (2001). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C10 PDFBibTeX XMLCite \textit{M. Klešč}, Discrete Math. 233, No. 1--3, 353--359 (2001; Zbl 0983.05027) Full Text: DOI
Jendrol’, S.; Voss, H.-J. Light subgraphs of multigraphs on compact 2-dimensional manifolds. (English) Zbl 0995.05038 Discrete Math. 233, No. 1-3, 329-351 (2001). Reviewer: Robert Jajcay (Terre Haute) MSC: 05C10 05C38 52B10 PDFBibTeX XMLCite \textit{S. Jendrol'} and \textit{H. J. Voss}, Discrete Math. 233, No. 1--3, 329--351 (2001; Zbl 0995.05038) Full Text: DOI
Hashemi, S. Mehdi Digraph embedding. (English) Zbl 0989.05032 Discrete Math. 233, No. 1-3, 321-328 (2001). Reviewer: F.Gliviak (Bratislava) MSC: 05C10 05C20 05C75 PDFBibTeX XMLCite \textit{S. M. Hashemi}, Discrete Math. 233, No. 1--3, 321--328 (2001; Zbl 0989.05032) Full Text: DOI
Crapo, Henry; Rosenstiehl, Pierre On lacets and their manifolds. (English) Zbl 0985.57008 Discrete Math. 233, No. 1-3, 299-320 (2001). Reviewer: Andrei Vesnin (Novosibirsk) MSC: 57M15 57N35 57M25 PDFBibTeX XMLCite \textit{H. Crapo} and \textit{P. Rosenstiehl}, Discrete Math. 233, No. 1--3, 299--320 (2001; Zbl 0985.57008) Full Text: DOI
Barbosa, Rommel; Hartnell, Bert Characterization of \(Z_m\)-well-covered graphs for some classes of graphs. (English) Zbl 0988.05080 Discrete Math. 233, No. 1-3, 293-297 (2001). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C75 PDFBibTeX XMLCite \textit{R. Barbosa} and \textit{B. Hartnell}, Discrete Math. 233, No. 1--3, 293--297 (2001; Zbl 0988.05080) Full Text: DOI
Nešetřil, Jaroslav; Zhu, Xuding Construction of sparse graphs with prescribed circular colorings. (English) Zbl 0982.05048 Discrete Math. 233, No. 1-3, 277-291 (2001). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{X. Zhu}, Discrete Math. 233, No. 1--3, 277--291 (2001; Zbl 0982.05048) Full Text: DOI
Kostochka, A.; Nešetřil, J.; Smolíková, P. Colorings and homomorphisms of degenerate and bounded degree graphs. (English) Zbl 0983.05032 Discrete Math. 233, No. 1-3, 257-276 (2001). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{A. Kostochka} et al., Discrete Math. 233, No. 1--3, 257--276 (2001; Zbl 0983.05032) Full Text: DOI
Kochol, Martin Stable dominating circuits in snarks. (English) Zbl 0986.05063 Discrete Math. 233, No. 1-3, 247-256 (2001). Reviewer: Mark E.Watkins (Syracuse) MSC: 05C38 PDFBibTeX XMLCite \textit{M. Kochol}, Discrete Math. 233, No. 1--3, 247--256 (2001; Zbl 0986.05063) Full Text: DOI
Kemnitz, Arnfried; Marangio, Massimiliano Chromatic numbers of integer distance graphs. (English) Zbl 0988.05039 Discrete Math. 233, No. 1-3, 239-246 (2001). Reviewer: Jozef Fiamčik (Prešov) MSC: 05C15 PDFBibTeX XMLCite \textit{A. Kemnitz} and \textit{M. Marangio}, Discrete Math. 233, No. 1--3, 239--246 (2001; Zbl 0988.05039) Full Text: DOI
Heckman, Christopher Carl; Thomas, Robin A new proof of the independence ratio of triangle-free cubic graphs. (English) Zbl 0982.05071 Discrete Math. 233, No. 1-3, 233-237 (2001). Reviewer: Peter Horák (Safat) MSC: 05C69 05C35 05C85 PDFBibTeX XMLCite \textit{C. C. Heckman} and \textit{R. Thomas}, Discrete Math. 233, No. 1--3, 233--237 (2001; Zbl 0982.05071) Full Text: DOI
Havet, Frédéric Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. (English) Zbl 0983.05031 Discrete Math. 233, No. 1-3, 219-231 (2001). Reviewer: Tamás Fleiner (Budapest) MSC: 05C15 90C35 05C90 05C85 PDFBibTeX XMLCite \textit{F. Havet}, Discrete Math. 233, No. 1--3, 219--231 (2001; Zbl 0983.05031) Full Text: DOI
Barré, Vincent On vertex neighborhood in minimal imperfect graphs. (English) Zbl 1003.05046 Discrete Math. 233, No. 1-3, 211-218 (2001). Reviewer: Saul Stahl (Lawrence) MSC: 05C17 05C38 PDFBibTeX XMLCite \textit{V. Barré}, Discrete Math. 233, No. 1--3, 211--218 (2001; Zbl 1003.05046) Full Text: DOI
Woźniak, Mariusz Note on compact packing of a graph. (English) Zbl 0985.05038 Discrete Math. 233, No. 1-3, 205-210 (2001). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{M. Woźniak}, Discrete Math. 233, No. 1--3, 205--210 (2001; Zbl 0985.05038) Full Text: DOI
Tewes, Meike Pancyclic in-tournaments. (English) Zbl 0987.05065 Discrete Math. 233, No. 1-3, 193-204 (2001). Reviewer: J.W.Moon (Edmonton) MSC: 05C38 05C20 05C45 05C35 PDFBibTeX XMLCite \textit{M. Tewes}, Discrete Math. 233, No. 1--3, 193--204 (2001; Zbl 0987.05065) Full Text: DOI
Nowakowski, R. J.; Whitehead, C. A. Ordered graceful labellings of the 2-star. (English) Zbl 0993.05129 Discrete Math. 233, No. 1-3, 183-191 (2001). Reviewer: Zsuzsanna Szaniszló (Vermillion) MSC: 05C78 PDFBibTeX XMLCite \textit{R. J. Nowakowski} and \textit{C. A. Whitehead}, Discrete Math. 233, No. 1--3, 183--191 (2001; Zbl 0993.05129) Full Text: DOI
Loebl, Martin; Matamala, Martin Some remarks on cycles in graphs and digraphs. (English) Zbl 0983.05055 Discrete Math. 233, No. 1-3, 175-182 (2001). Reviewer: Tamás Fleiner (Budapest) MSC: 05C38 05C20 05C75 52C07 PDFBibTeX XMLCite \textit{M. Loebl} and \textit{M. Matamala}, Discrete Math. 233, No. 1--3, 175--182 (2001; Zbl 0983.05055) Full Text: DOI
Kostochka, A. V.; Woodall, D. R. Sparse sets in the complements of graphs with given girth. (English) Zbl 0983.05065 Discrete Math. 233, No. 1-3, 163-174 (2001). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C70 05C38 05C69 PDFBibTeX XMLCite \textit{A. V. Kostochka} and \textit{D. R. Woodall}, Discrete Math. 233, No. 1--3, 163--174 (2001; Zbl 0983.05065) Full Text: DOI
Knor, M.; Niepel, L’. Diameter in iterated path graphs. (English) Zbl 0989.05036 Discrete Math. 233, No. 1-3, 151-161 (2001). Reviewer: F.Gliviak (Bratislava) MSC: 05C12 05C38 PDFBibTeX XMLCite \textit{M. Knor} and \textit{L'. Niepel}, Discrete Math. 233, No. 1--3, 151--161 (2001; Zbl 0989.05036) Full Text: DOI
Hrnčiar, Pavel; Haviar, Alfonz All trees of diameter five are graceful. (English) Zbl 0986.05088 Discrete Math. 233, No. 1-3, 133-150 (2001). Reviewer: G.Wegner (Dortmund) MSC: 05C78 05C05 PDFBibTeX XMLCite \textit{P. Hrnčiar} and \textit{A. Haviar}, Discrete Math. 233, No. 1--3, 133--150 (2001; Zbl 0986.05088) Full Text: DOI
Harminc, Matúš; Soták, Roman Graphs with average labellings. (English) Zbl 0985.05044 Discrete Math. 233, No. 1-3, 127-132 (2001). MSC: 05C78 05C75 PDFBibTeX XMLCite \textit{M. Harminc} and \textit{R. Soták}, Discrete Math. 233, No. 1--3, 127--132 (2001; Zbl 0985.05044) Full Text: DOI
Fronček, Dalibor On seed graphs with more than two components. (English) Zbl 0983.05076 Discrete Math. 233, No. 1-3, 115-126 (2001). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C99 PDFBibTeX XMLCite \textit{D. Fronček}, Discrete Math. 233, No. 1--3, 115--126 (2001; Zbl 0983.05076) Full Text: DOI
Ferrero, Daniela; Padró, Carles New bounds on the diameter vulnerability of iterated line digraphs. (English) Zbl 0982.05063 Discrete Math. 233, No. 1-3, 103-113 (2001). Reviewer: Peter Horák (Safat) MSC: 05C40 05C20 05C35 PDFBibTeX XMLCite \textit{D. Ferrero} and \textit{C. Padró}, Discrete Math. 233, No. 1--3, 103--113 (2001; Zbl 0982.05063) Full Text: DOI
Enomoto, Hikoe Graph partition problems into cycles and paths. (English) Zbl 0985.05036 Discrete Math. 233, No. 1-3, 93-101 (2001). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{H. Enomoto}, Discrete Math. 233, No. 1--3, 93--101 (2001; Zbl 0985.05036) Full Text: DOI
Cai, Maocheng; Flandrin, Evelyne; Li, Hao On quasifactorability in graphs. (English) Zbl 0985.05034 Discrete Math. 233, No. 1-3, 85-92 (2001). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Cai} et al., Discrete Math. 233, No. 1--3, 85--92 (2001; Zbl 0985.05034) Full Text: DOI
Caha, R.; Koubek, V. Optimal embeddings of generalized ladders into hypercubes. (English) Zbl 0986.05034 Discrete Math. 233, No. 1-3, 65-83 (2001). Reviewer: Tomáš Dvořák (Praha) MSC: 05C10 68R10 PDFBibTeX XMLCite \textit{R. Caha} and \textit{V. Koubek}, Discrete Math. 233, No. 1--3, 65--83 (2001; Zbl 0986.05034) Full Text: DOI
Broersma, Hajo; Ryjáček, Zdeněk Strengthening the closure concept in claw-free graphs. (English) Zbl 0981.05067 Discrete Math. 233, No. 1-3, 55-63 (2001). Reviewer: Dieter Rautenbach (Aachen) MSC: 05C45 05C35 PDFBibTeX XMLCite \textit{H. Broersma} and \textit{Z. Ryjáček}, Discrete Math. 233, No. 1--3, 55--63 (2001; Zbl 0981.05067) Full Text: DOI
Boza, L.; Dávila, M. T.; Márquez, A.; Moyano, R. Miscellaneous properties of embeddings of line, total and middle graphs. (English) Zbl 0986.05033 Discrete Math. 233, No. 1-3, 37-54 (2001). Reviewer: Dan S.Archdeacon (Burlington) MSC: 05C10 05C75 PDFBibTeX XMLCite \textit{L. Boza} et al., Discrete Math. 233, No. 1--3, 37--54 (2001; Zbl 0986.05033) Full Text: DOI
Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history. (English) Zbl 0999.01019 Discrete Math. 233, No. 1-3, 3-36 (2001). Reviewer: Roman Duda (Wrocław) MSC: 01A60 01A75 90C27 90-03 PDFBibTeX XMLCite \textit{J. Nešetřil} et al., Discrete Math. 233, No. 1--3, 3--36 (2001; Zbl 0999.01019) Full Text: DOI