default search action
Journal of Graph Theory, Volume 35
Volume 35, Number 1, September 2000
- Dragan Marusic, Tomaz Pisanski:
The Gray graph revisited. 1-7 - Guojun Li:
Edge disjoint Hamilton cycles in graphs. 8-20 - Michael A. Henning:
Graphs with large total domination number. 21-45 - William McCuaig:
Even dicycles. 46-68
Volume 35, Number 2, October 2000
- Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. 69-82 - Ron Aharoni, Penny Haxell:
Hall's theorem for hypergraphs. 83-88 - Dennis Eichhorn, Dhruv Mubayi, Kevin O'Bryant, Douglas B. West:
The edge-bandwidth of theta graphs. 89-98 - Chula J. Jayawardene, Cecil C. Rousseau:
The Ramsey number for a cycle of length five vs. a complete graph of order six. 99-108 - Sean McGuinness:
On decomposing a graph into nontrivial bonds. 109-127 - Rudolf Halin:
Miscellaneous problems on infinite graphs. 128-151 - Dragan Marusic:
Constructing cubic edge- but not vertex-transitive graphs. 152-160
Volume 35, Number 3, November 2000
- Noga Alon, András Gyárfás, Miklós Ruszinkó:
Decreasing the diameter of bounded degree graphs. 161-172 - Fred Galvin:
Another note on cliques and independent sets. 173-175 - Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On graphs with linear Ramsey numbers. 176-192 - Noga Alon, Michael Krivelevich, Paul D. Seymour:
Long cycles in critical graphs. 193-196 - Daniel P. Sanders, Yue Zhao:
Coloring edges of embedded graphs. 197-205 - Alexander K. Kelmans:
Crossing properties of graph reliability functions. 206-221 - Gelasio Salazar:
A lower bound for the crossing number of Cm × Cn. 222-226
Volume 35, Number 4, December 2000
- Petra Johann:
On the structure of graphs with a unique k-factor. 227-243 - Frédéric Havet, Stéphan Thomassé:
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. 244-256 - Fábio Protti, Jayme Luiz Szwarcfiter:
Clique-inverse graphs of K3-free and K4-free graphs. 257-272 - Reinhard Diestel:
An accessibility theorem for infinite graph minors. 273-277 - Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray:
An extremal bandwidth problem for bipartite graphs. 278-289
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-01-14 21:05 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: