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