default search action
Journal of Graph Theory, Volume 32
Volume 32, Number 1, September 1999
- Romeo Rizzi:
Indecomposable r-graphs and some other counterexamples. 1-15 - Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow:
On k-ordered Hamiltonian graphs. 17-25 - Raphael Yuster:
Decomposing large graphs with small graphs of high density. 27-40 - Konrad Piwakowski, Stanislaw P. Radziszowski, Sebastian Urbanski:
Computation of the Folkman number Fe(3, 3; 5). 41-49 - Akira Saito:
Degree sums and graphs that are not covered by two cycles. 51-61 - Lingling Huang, Gerard J. Chang:
The circular chromatic number of the Mycielskian of G. 63-71 - Irena Rusu:
Berge graphs with chordless cycles of bounded length. 73-79 - Thomas Böhme, Jochen Harant, Michal Tkác:
On certain Hamiltonian cycles in planar graphs. 81-96 - Pierre Boiron, Éric Sopena, Laurence Vignal:
Acrylic improper colorings of graphs. 97-107
Volume 32, Number 2, October 1999
- Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure, 2-factors, and cycle coverings in claw-free graphs. 109-117 - Matthias Kriesell:
On a conjecture of Thomassen and Toft. 118-122 - Anders Yeo:
Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments. 123-136 - Anders Yeo:
Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5. 137-152 - József Balogh, András Pluhár:
A sharp edge bound on the interval number of a graph. 153-159 - Richard H. Hammack:
Cyclicity of graphs. 160-170 - Paul J. Tanenbaum:
Simultaneous intersection representation of pairs of graphs. 171-190 - Reinhard Diestel, Daniela Kühn:
A universal planar graph under the minor relation. 191-206 - Yair Caro, Christian Provstgaard:
Zero-sum delta-systems and multiple copies of graphs. 207-216
Volume 32, Number 3, November 1999
- Shao-Fei Du, Dragan Marusic:
An infinite family of biprimitive semisymmetric graphs. 217-228 - Peter J. Cameron:
SGDs with doubly transitive automorphism group. 229-233 - Petr Hlinený:
A note on possible extensions of Negami's conjecture. 234-240 - Frank Jelen:
k-Independence and the k-residue of a graph. 241-249 - Martin Juvan, Bojan Mohar, Riste Skrekovski:
Graphs of degree 4 are 5-edge-choosable. 250-264 - Xiaotie Deng, Christos H. Papadimitriou:
Exploring an unknown graph. 265-297 - John F. P. Hudson:
Distinguishing two graph-encoded manifolds of Lins. 298-302 - Igor E. Zverovich:
k-Bounded classes of dominant-independent perfect graphs. 303-310
Volume 32, Number 4, December 1999
- S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic index of graphs and multigraphs. 311-326 - Thomas Böhme, Bojan Mohar, Michael Stiebitz:
Dirac's map-color theorem for choosability. 327-339 - In-Jen Lin, Malay K. Sen, Douglas B. West:
Intersection representation of digraphs in trees with few leaves. 340-353 - Tao Jiang, Douglas B. West:
Coloring of trees with minimum sum of colors. 354-358 - Irena Rusu:
Perfectly contractile diamond-free graphs. 359-389 - Glenn G. Chappell:
A lower bound for partial list colorings. 390-393 - Annegret Wagler:
On critically perfect graphs. 394-404 - Thomas Böhme, Jochen Harant, Michal Tkác:
More than one tough chordal planar graphs are Hamiltonian. 405-410
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 2024-12-15 01:17 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: