default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 233
Volume 233, Number 1-3, April 2001
- Miroslav Fiedler, Jan Kratochvíl
, Jaroslav Nesetril:
Foreword. 1-2 - Jaroslav Nesetril, Eva Milková, Helena Nesetrilová:
Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. 3-36 - Luis Boza, Maria Teresa Davila, Alberto Márquez, Rafael Moyano:
Miscellaneous properties of embeddings of line, total and middle graphs. 37-54 - Hajo Broersma, Zdenek Ryjácek:
Strengthening the closure concept in claw-free graphs. 55-63 - Rostislav Caha, Václav Koubek:
Optimal embeddings of generalized ladders into hypercubes. 65-83 - Mao-cheng Cai, Evelyne Flandrin, Hao Li:
On quasifactorability in graphs. 85-92 - Hikoe Enomoto:
Graph partition problems into cycles and paths. 93-101 - Daniela Ferrero, Carles Padró:
New bounds on the diameter vulnerability of iterated line digraphs. 103-113 - Dalibor Froncek:
On seed graphs with more than two components. 115-126 - Matús Harminc, Roman Soták:
Graphs with average labellings. 127-132 - Pavel Hrnciar, Alfonz Haviar:
All trees of diameter five are graceful. 133-150 - Martin Knor, Ludovít Niepel:
Diameter in iterated path graphs. 151-161 - Alexandr V. Kostochka, Douglas R. Woodall:
Sparse sets in the complements of graphs with given girth. 163-174 - Martin Loebl, Martín Matamala:
Some remarks on cycles in graphs and digraphs. 175-182 - Richard J. Nowakowski, Carol A. Whitehead:
Ordered graceful labellings of the 2-star. 183-191 - Meike Tewes:
Pancyclic in-tournaments. 193-204 - Mariusz Wozniak:
Note on compact packing of a graph. 205-210 - Vincent Barré:
On vertex neighborhood in minimal imperfect graphs. 211-218 - Frédéric Havet:
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. 219-231 - Christopher Carl Heckman, Robin Thomas:
A new proof of the independence ratio of triangle-free cubic graphs. 233-237 - Arnfried Kemnitz, Massimiliano Marangio:
Chromatic numbers of integer distance graphs. 239-246 - Martin Kochol:
Stable dominating circuits in snarks. 247-256 - Alexandr V. Kostochka, Jaroslav Nesetril, Petra Smolíková:
Colorings and homomorphisms of degenerate and bounded degree graphs. 257-276 - Jaroslav Nesetril, Xuding Zhu:
Construction of sparse graphs with prescribed circular colorings. 277-291 - Rommel M. Barbosa, Bert L. Hartnell:
Characterization of Zm-well-covered graphs for some classes of graphs. 293-297 - Henry Crapo, Pierre Rosenstiehl:
On lacets and their manifolds. 299-320 - S. Mehdi Hashemi:
Digraph embedding. 321-328 - Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs on compact 2-dimensional manifolds. 329-351 - Marián Klesc:
The crossing numbers of Cartesian products of paths with 5-vertex graphs. 353-359 - Jirí Matousek:
Lower bound on the minus-domination number. 361-370 - Jana Maxová, Jaroslav Nesetril:
On oriented path double covers. 371-380 - Blaz Zmazek, Janez Zerovnik:
On recognizing Cartesian graph bundles. 381-391
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-14 23:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
