Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 34
Volume 34, Number 1, May 2000
- Robert Jajcay, Dale M. Mesner:
Embedding arbitrary finite simple graphs into small strongly regular graphs. 1-8 - Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. 9-19 - Dhruv Mubayi:
Graphic sequences that have a realization with large clique number. 20-29 - Stephan Brandt, Odile Favaron, Zdenek Ryjácek:
Closure and stable Hamiltonian properties in claw-free graphs. 30-41 - Béla Bollobás, Colin Cooper, Trevor I. Fenner, Alan M. Frieze:
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. 42-59 - Michael A. Henning:
On cliques and bicliques. 60-66 - Peter Niemeyer, Mark E. Watkins:
Geodetic rays and fibers in periodic graphs. 67-88 - Dragan Marusic, Adrian O. Waller:
Half-transitive graphs of valency 4 with prescribed attachment numbers. 89-99 - Steven D. Noble, D. J. A. Welsh:
Knot graphs. 100-111
Volume 34, Number 2, June 2000
- Peter Horák, Katherine Heinrich:
Partitioning infinite trees. 113-127 - Valery A. Liskovets, Reinhard Pöschel:
Non-Cayley-isomorphic self-complementary circulant graphs. 128-141 - Johannes H. Hattingh, Michael A. Henning:
Characterizations of trees with equal domination parameters. 142-153 - Hong Wang:
Digraphs containing every possible pair of dicycles. 154-162 - Hikoe Enomoto, Katsuhiro Ota:
Partitions of a graph into paths with prescribed endvertices and lengths. 163-169 - Bojan Mohar:
Light paths in 4-connected graphs in the plane and other surfaces. 170-179 - Zoltán Füredi, Dhruv Mubayi, Douglas B. West:
Multiple vertex coverings by specified induced subgraphs. 180-190
Volume 34, Number 3, July 2000
- Amel Harkat-Benhamdine, Hao Li, Feng Tian:
Cyclability of 3-connected graphs. 191-203 - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. 204-220 - Mark N. Ellingham, D. K. Menser:
Girth, minimum degree, and circumference. 221-233 - Tommy R. Jensen, Carsten Thomassen:
The color space of a graph. 234-245
Volume 34, Number 4, August 2000
- Fan R. K. Chung, Shing-Tung Yau:
A Harnack inequality for Dirichlet eigenvalues. 247-257 - Ernest J. Cockayne, Gary MacGillivray, Jill Simmons:
CO-irredundant Ramsey numbers for graphs. 258-268 - Cristina Bazgan, Hao Li, Mariusz Wozniak:
On the Loebl-Komlós-Sós conjecture. 269-276 - Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. 277-292
a service of 
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-04-25 20:51 CEST 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:
