default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 22
Volume 22, Number 1, 2002
- Jochen Harant, Ingo Schiermeyer, Margit Voigt:
Preface. 5-6 - J. Adrian Bondy, Hajo Broersma
, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. 7-15 - Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Weakly P-saturated graphs. 17-29 - Izak Broere, Jozef Bucko, Peter Mihók:
Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties. 31-37 - Andrey A. Dobrynin, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther:
Some news about oblique graphs. 39-50 - Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster:
Frequency planning and ramifications of coloring. 51-88 - Jirí Fiala, Jan Kratochvíl:
Partial covers of graphs. 89-99 - Patrick W. Fowler, Peter E. John:
Dûrer polyhedra: The dark side of melancholia. 101-109 - Frank Göring:
A proof of Menger's Theorem by contraction. 111-112 - Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decompositions of multigraphs into parts with two edges. 113-121 - Judith Keijsper, Meike Tewes:
Conditions for β-perfectness. 123-148 - Arnfried Kemnitz, Massimiliano Marangio:
Edge colorings and total colorings of integer distance graphs. 149-158 - Bert Randerath, Preben D. Vestergaard:
On well-covered graphs of odd girth 7 or greater. 159-172 - Richard H. Schelp:
Three edge-coloring conjectures. 173-182 - Gabriel Semanisin:
On generating sets of induced-hereditary properties. 183-192 - Michal Tkác, Heinz-Jürgen Voss:
On k-trestles in polyhedreal graphs. 193-198 - Zsolt Tuza, Preben D. Vestergaard:
Domination in partitioned graphs. 199-210
Volume 22, Number 2, 2002
- Hajo Broersma, Xueliang Li:
Isomorphisms and traversability of directed path graphs. 215-228 - Tobias Gerlach, Jochen Harant:
A note on domination in bipartite graphs. 229-231 - Teresa W. Haynes, Michael A. Henning:
Trees with unique minimum total dominating sets. 233-246 - Ibrahim Cahit:
Some totally modular cordial graphs. 247-258 - Izak Broere, Samantha Dorfling, Elizabeth Jonck:
Generalized chromatic numbers and additive hereditary properties of graphs. 259-270 - Benoît Larose:
Families of strongly projective graphs. 271-292 - Tomás Madaras, Andrea Marcinova:
On the structural result on normal plane maps. 293-303 - Varaporn Saenpholphat, Ping Zhang:
Connected partition dimensions of graphs. 305-323 - Michael A. Henning:
A characterization of Roman trees. 325-334 - Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar:
Effect of edge-subdivision on vertex-domination in a graph. 335-347 - Michael Dorfling, Samantha Dorfling:
Generalized edge-chromatic numbers and additive hereditary properties of graphs. 349-359 - Zdzislaw Skupien:
Clique parts independent of remainders. 361-361
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-04 01:29 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:
