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
[1]
Hilfe
Suche: Journal=J. Graph Theory AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Domination in planar graphs with small diameter
Wayne Goddard
,
Michael A. Henning
Journal of Graph Theory
40
(1), 2002, pp. 1-25
Total choosability of multicircuits I
Alexandr V. Kostochka
,
Douglas R. Woodall
Journal of Graph Theory
40
(1), 2002, pp. 26-43
Total choosability of multicircuits II
Alexandr V. Kostochka
,
Douglas R. Woodall
Journal of Graph Theory
40
(1), 2002, pp. 44-67
Extremal problems for chromatic neighborhood sets
André Kündgen
,
Michael Molloy
Journal of Graph Theory
40
(1), 2002, pp. 68-74
Hamiltonian cycles in
n
-extendable graphs
Ken-ichi Kawarabayashi
,
Katsuhiro Ota
,
Akira Saito
Journal of Graph Theory
40
(2), 2002, pp. 75-82
Acyclic list 7-coloring of planar graphs
O.V. Borodin
,
D.G. Fon-Der Flaass
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Journal of Graph Theory
40
(2), 2002, pp. 83-90
Tiled partial cubes
Bos̑tjan Bres̑ar
,
Wilfried Imrich
,
Sandi Klavz̑ar
,
Henry Martyn Mulder
,
Riste S̑krekovski
Journal of Graph Theory
40
(2), 2002, pp. 91-103
Forbidden subgraphs that imply Hamiltonian-connectedness
Hajo Broersma
,
Ralph J. Faudree
,
Andreas Huck
,
Huib Trommel
,
Henk Jan Veldman
Journal of Graph Theory
40
(2), 2002, pp. 104-119
A Ramsey-type problem and the Turán numbers
Noga Alon
,
P. Erdŏs
,
D.S. Gunderson
,
M. Molloy
Journal of Graph Theory
40
(2), 2002, pp. 120-129
On chromatic-choosable graphs
Kyoji Ohba
Journal of Graph Theory
40
(2), 2002, pp. 130-135
Tension polynomials of graphs
Martin Kochol
Journal of Graph Theory
40
(3), 2002, pp. 137-146
Circular flows of nearly Eulerian graphs and vertex-splitting
Cun Quan Zhang
Journal of Graph Theory
40
(3), 2002, pp. 147-161
Projectivity and independent sets in powers of graphs
Benoit Larose
,
Claude Tardif
Journal of Graph Theory
40
(3), 2002, pp. 162-171
Packing trees into planar graphs
A. García
,
C. Hernando
,
F. Hurtado
,
M. Noy
,
J. Tjel
Journal of Graph Theory
40
(3), 2002, pp. 172-181
Convex-round graphs are circular-perfect
Jrgen Bang-Jensen
,
Jing Huang
Journal of Graph Theory
40
(3), 2002, pp. 182-194
Turán problems for integer-weighted graphs
Zoltán Füredi
,
André Kündgen
Journal of Graph Theory
40
(4), 2002, pp. 195-225
On splittable colorings of graphs and hypergraphs
Zoltán Füredi
,
Radhika Ramamurthi
Journal of Graph Theory
40
(4), 2002, pp. 226-237
Even-hole-free graphs - Part II: Recognition algorithm
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Journal of Graph Theory
40
(4), 2002, pp. 238-266
Orthogonal facatorizations of graphs
Haodi Feng
,
Guizhen Liu
Journal of Graph Theory
40
(4), 2002, pp. 267-276
A note on Ramsey size-linear graphs
P.N. Balister
,
R.H. Schelp
,
M. Simonovits
Journal of Graph Theory
39
(1), 2002, pp. 1-5
Even-hole-free graphs - Part I: Decomposition theorem
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Journal of Graph Theory
39
(1), 2002, pp. 6-49
On the critical point-arboricity graphs
Riste S̑krekovski
Journal of Graph Theory
39
(1), 2002, pp. 50-61
Connected
(g, f)
-factors
M.N. Ellingham
,
Yunsun Nam
,
Heinz-Jürgen Voss
Journal of Graph Theory
39
(1), 2002, pp. 62-75
Codiameters of 3-connected 3-domination critical graphs
Yaojun Chen
,
Feng Tian
,
Bing Wei
Journal of Graph Theory
39
(1), 2002, pp. 76-85
Recursive constructions for triangulations
M.J. Grannell
,
T.S. Griggs
,
J. S̑irán̑
Journal of Graph Theory
39
(2), 2002, pp. 87-107
Seiten
<
1
2
3
>