Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 37
Volume 37, Number 1, May 2001
- Jozef Sirán, Thomas W. Tucker, Mark E. Watkins:
Realizing finite edge-transitive orientable maps. 1-34 - Thomas Böhme, Frank Göring
, Jochen Harant:
Menger's Theorem. 35-36 - Yoshiyasu Ishigami:
Vertex-disjoint cycles of length at most four each of which contains a specified vertex. 37-47 - Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy:
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. 48-77
Volume 37, Number 2, June 2001
- Manuel Aivaliotis, Gary Gordon, William Graveman:
When bad things happen to good trees. 79-99 - Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic numbers of quadrangulations on closed surfaces. 100-114 - Tao Jiang:
Small odd cycles in 4-chromatic graphs. 115-117 - Geoffrey Exoo:
A family of graphs and the degree/diameter problem. 118-124 - Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek:
On factors of 4-connected claw-free graphs. 125-136
Volume 37, Number 3, July 2001
- Rao Li, Akira Saito, Richard H. Schelp:
Relative length of longest paths and cycles in 3-connected graphs. 137-156 - Noga Alon, Benny Sudakov, Ayal Zaks:
Acyclic edge colorings of graphs. 157-167 - Jianping Li:
On the Thomassen's conjecture. 168-180 - Stanislav Jendrol', Marián Klesc:
On graphs whose line graphs have crossing number one. 181-188
Volume 37, Number 4, August 2001
- Guoli Ding, Thor Johnson, Paul D. Seymour:
Spanning trees with many leaves. 189-197 - Alexandr V. Kostochka, Vojtech Rödl:
On graphs with small Ramsey numbers. 198-204 - Paul J. P. Grobler, Christina M. Mynhardt:
Vertex criticality for upper domination and irredundance. 205-212 - Jaeun Lee:
Independent perfect domination sets in Cayley graphs. 213-219 - Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz:
Almost all graphs with high girth and suitable density have high chromatic number. 220-226 - Petr Hlinený:
Another two graphs with no planar covers. 227-242 - Artem V. Pyatkin:
A Graph with cover degeneracy less than chromatic number. 243-246
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 05:29 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:
