Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 33
Volume 33, Number 1, January 2000
- Peter Dankelmann, Roger C. Entringer:
Average distance, minimum degree, and spanning trees. 1-13 - Pavol Hell, Xuding Zhu:
The circular chromatic number of series-parallel graphs. 14-24 - Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger:
Maximal sets of Hamilton cycles in Kn, n. 25-31 - Chính T. Hoàng, Xiaodan Tu:
On the perfect orderability of unions of two graphs. 32-43 - Peter Mihók, Gabriel Semanisin, Roman Vasky:
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors. 44-53
Volume 33, Number 2, February 2000
- Mark V. Barovich:
Long paths through four vertices in a 2-connected graph. 55-65 - Richard H. Schelp, Andrew Thomason:
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs. 66-82 - Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan:
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. 83-93 - Xudong Yuan, Liying Kang, Mao-cheng Cai:
The number of vertices of degree k in a minimally k-edge-connected digraph. 94-108 - William Klostermeyer, Cun-Quan Zhang:
(2 + ϵ)-Coloring of planar graphs with large odd-girth. 109-119 - Alexander K. Kelmans:
On convex embeddings of planar 3-connected graphs. 120-124
Volume 33, Number 3, March 2000
- Mark N. Ellingham, Xiaoya Zha:
Toughness, trees, and walks. 125-137 - Romeo Rizzi:
A short proof of König's matching theorem. 138-139 - Yue Zhao:
3-Coloring graphs embedded in surfaces. 140-143 - Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of complete multipartite graphs into generalized cubes. 144-150 - Terry A. McKee:
Strong clique trees, neighborhood trees, and strongly chordal graphs. 151-160 - Hung-Lin Fu, Christopher A. Rodger:
Forest leaves and four-cycles. 161-166 - David Peleg:
Proximity-preserving labeling schemes. 167-176 - Gregory Z. Gutin, Anders Yeo:
Kings in semicomplete multipartite digraphs. 177-183
Volume 33, Number 4, April 2000
- Chihyun Chien, Xuding Zhu:
The circular chromatic number of series-parallel graphs with large girth. 185-198 - Matthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.:
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs. 199-219 - Beifang Chen, Jin Ho Kwak, Serge Lawrencenko:
Weinberg bounds over nonspherical graphs. 220-236 - Ajit A. Diwan:
Decomposing graphs with girth at least five under degree constraints. 237-239 - Stefan Grünewald:
Chromatic-index critical multigraphs of order 20. 240-245 - Yair Caro, Bert L. Hartnell:
A characterization of Zm-well-covered graphs of girth 6 or more. 246-255 - Thomas Niessen, Jaakob Kind:
The round-up property of the fractional chromatic number for proper circular arc graphs. 256-267
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-15 20:35 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:
