Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Graph Theory AND Volume=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average distance, minimum degree, and spanning trees
Peter Dankelmann
,
Roger Entringer
Journal of Graph Theory
33
(1), 2000, pp. 1-13
The circular chromatic number of series-parallel graphs
Pavol Hell
,
Xuding Zhu
Journal of Graph Theory
33
(1), 2000, pp. 14-24
Maximal sets of Hamilton cycles in
K_{n,n}
Darryn E. Bryant
,
S. El-Zanati
,
C.A. Rodger
Journal of Graph Theory
33
(1), 2000, pp. 25-31
On the perfect orderability of unions of two graphs
Chính T. Hoàng
,
Xiaodan Tu
Journal of Graph Theory
33
(1), 2000, pp. 32-43
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
Peter Mihók
,
Gabriel Semanis̑in
,
Roman Vasky
Journal of Graph Theory
33
(1), 2000, pp. 44-53
Long paths through four vertices in a 2-connected graph
Mark V. Barovich
Journal of Graph Theory
33
(2), 2000, pp. 55-65
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
Richard H. Schelp
,
Andrew Thomason
Journal of Graph Theory
33
(2), 2000, pp. 66-82
Four-terminal reducibility and projective-planar Wye-Delta-Wye-reducible graphs
Dan Archdeacon
,
Charles J. Colbourn
,
Isidoro Gitler
,
J. Scott Provan
Journal of Graph Theory
33
(2), 2000, pp. 83-93
The number of vertices of degree
k
in a minimally
k
-edge-connected digraph
Yuan Xu-dong
,
Kang Liying
,
Cai Mao-cheng
Journal of Graph Theory
33
(2), 2000, pp. 94-108
(2+\epsilon)
-coloring of planar graphs with large odd-girth
William Klostermeyer
,
Cun Quan Zhang
Journal of Graph Theory
33
(2), 2000, pp. 109-119
On convex embeddings of planar 3-connected graphs
Alexander Kelmans
Journal of Graph Theory
33
(2), 2000, pp. 120-124
Toughness, trees, and walks
M.N. Ellingham
,
Xiaoya Zha
Journal of Graph Theory
33
(3), 2000, pp. 125-137
A short proof of König's matching theorem
Romeo Rizzi
Journal of Graph Theory
33
(3), 2000, pp. 138-139
3-coloring graphs embedded in surfaces
Yue Zhao
Journal of Graph Theory
33
(3), 2000, pp. 140-143
Factorizations of complete multipartite graphs into generalized cubes
S. El-Zanati
,
C. Vanden Eynden
Journal of Graph Theory
33
(3), 2000, pp. 144-150
Strong clique trees, neighborhood trees, and strongly chordal graphs
Terry A. McKee
Journal of Graph Theory
33
(3), 2000, pp. 151-160
Forest leaves and four-cycles
H.L. Fu
,
C.A. Rodger
Journal of Graph Theory
33
(3), 2000, pp. 161-166
Proximity-preserving labeling schemes
David Peleg
Journal of Graph Theory
33
(3), 2000, pp. 167-176
Kings in semicomplete multipartite digraphs
Gregory Gutin
,
Anders Yeo
Journal of Graph Theory
33
(3), 2000, pp. 177-183
The circular chromatic number of series-parallel graphs with large girth
Chihyun Chien
,
Xuding Zhu
Journal of Graph Theory
33
(4), 2000, pp. 185-198
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
M.M. Cropper
,
J.L. Goldwasser
,
A.J.W. Hilton
,
D.G. Hoffman
,
P.D., Jr. Johnson
Journal of Graph Theory
33
(4), 2000, pp. 199-219
Weinberg bounds over nonspherical graphs
Beifang Chen
,
Jin Ho Kwak
,
Serge Lawrencenko
Journal of Graph Theory
33
(4), 2000, pp. 220-236
Decomposing graphs with girth at least five under degree constraints
Ajit A. Diwan
Journal of Graph Theory
33
(4), 2000, pp. 237-239
Chromatic-index critical multigraphs of order 20
Stefan Grünewald
Journal of Graph Theory
33
(4), 2000, pp. 240-245
A characterization of
Z_m
-well-covered graphs of girth 6 or more
Y. Caro
,
B. Hartnell
Journal of Graph Theory
33
(4), 2000, pp. 246-255
Seiten 1
2
>