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=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding arbitrary finite simple graphs into small strongly regular graphs
Robert Jajcay
,
Dale Mesner
Journal of Graph Theory
34
(1), 2000, pp. 1-8
Total domination in graphs with minimum degree three
Odile Favaron
,
Michael A. Henning
,
Christina M. Mynhart
,
Joël Puech
Journal of Graph Theory
34
(1), 2000, pp. 9-19
Graphic sequences that have a realization with large clique number
Dhruv Mubayi
Journal of Graph Theory
34
(1), 2000, pp. 20-29
Closure and stable Hamiltonian properties in claw-free graphs
Stephan Brandt
,
Odile Favaron
,
Zdenȇk Ryjác̑ek
Journal of Graph Theory
34
(1), 2000, pp. 30-41
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least
k
B. Bollobás
,
C. Cooper
,
T.I. Fenner
,
A.M. Frieze
Journal of Graph Theory
34
(1), 2000, pp. 42-59
On cliques and bicliques
Michael H. Henning
Journal of Graph Theory
34
(1), 2000, pp. 60-66
Geodetic rays and fibers in periodic graphs
Peter Niemeyer
,
Mark E. Watkins
Journal of Graph Theory
34
(1), 2000, pp. 67-88
Half-transitive graphs of valency 4 with prescribed attachment numbers
Dragan Marus̑ic̑
,
Adrian O. Waller
Journal of Graph Theory
34
(1), 2000, pp. 89-99
Knot graphs
S.D. Noble
,
D.J.A. Welsh
Journal of Graph Theory
34
(1), 2000, pp. 100-111
Partitioning infinite trees
Peter Horak
,
Katherine Heinrich
Journal of Graph Theory
34
(2), 2000, pp. 113-127
Non-Cayley-isomorphic self-complementary circulant graphs
Valery Liskovets
,
Reinhard Pöschel
Journal of Graph Theory
34
(2), 2000, pp. 128-141
Characterizations of trees with equal domination parameters
Johannes H. Hattingh
,
Michael A. Henning
Journal of Graph Theory
34
(2), 2000, pp. 142-153
Digraphs containing every possible pair of dicycles
Hong Wang
Journal of Graph Theory
34
(2), 2000, pp. 154-162
Partitions of a graph into paths with prescribed endvertices and lengths
Hikoe Enomoto
,
Katsuhiro Ota
Journal of Graph Theory
34
(2), 2000, pp. 163-169
Ligth paths in 4-connected graphs in the plane and other surfaces
Bojan Mohar
Journal of Graph Theory
34
(2), 2000, pp. 170-179
Multiple vertex coverings by specified induced subgraphs
Zoltán Füredi
,
Dhruv Mubayi
,
Douglas B. West
Journal of Graph Theory
34
(2), 2000, pp. 180-190
Cyclability of 3-connected graphs
Amel Harkat-Benhamdine
,
Hao Li
,
Feng Tian
Journal of Graph Theory
34
(3), 2000, pp. 191-203
Triangle-free graphs that are signable without even holes
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Journal of Graph Theory
34
(3), 2000, pp. 204-220
Girth, minimum degree, and circumference
M.N. Ellingham
,
D.K. Menser
Journal of Graph Theory
34
(3), 2000, pp. 221-233
The color space of a graph
Tommy R. Jensen
,
Carsten Thomassen
Journal of Graph Theory
34
(3), 2000, pp. 234-245
A Harnack inequality for Dirichlet eigenvalues
Fan Chung
,
S.-T. Yau
Journal of Graph Theory
34
(4), 2000, pp. 247-257
CO
-irredundant Ramsey numbers for graphs
E.J. Cockayne
,
G. MacGillivray
,
J. Simmons
Journal of Graph Theory
34
(4), 2000, pp. 258-268
On the Loebl-Komlós-Sós conjecture
Cristina Bazgan
,
Hao Li
,
Mariusz Woźniak
Journal of Graph Theory
34
(4), 2000, pp. 269-276
A characterization of
y, i)
-trees
E.J. Cockayne
,
O. Favaron
,
C.M. Mynhardt
,
J. Puech
Journal of Graph Theory
34
(4), 2000, pp. 277-292