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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
k
-bounded classes of dominant-independent perfect graphs
Igor E. Zverovich
Journal of Graph Theory
32
(3), 1999, pp. 303-310
Improved bounds for the chromatic index of graphs and multigraphs
S. Louis Hakimi
,
Edward F. Schmeichel
Journal of Graph Theory
32
(4), 1999, pp. 311-326
Dirac's map-color theorem for choosability
T. Böhme
,
B. Mohar
,
M. Stiebitz
Journal of Graph Theory
32
(4), 1999, pp. 327-339
Intersection representation of digraphs in trees with few leaves
In-Jen Lin
,
Malay K. Sen
,
Douglas B. West
Journal of Graph Theory
32
(4), 1999, pp. 340-353
Coloring of trees with minimum sum of colors
Tao Jiang
,
Douglas B. West
Journal of Graph Theory
32
(4), 1999, pp. 354-358
Perfectly contractile diamond-free graphs
Irena Rusu
Journal of Graph Theory
32
(4), 1999, pp. 359-389
A lower bound for partial list colorings
Glenn G. Chappell
Journal of Graph Theory
32
(4), 1999, pp. 390-393
On critically perfect graphs
Annegret Wagler
Journal of Graph Theory
32
(4), 1999, pp. 394-404
More than one tough chordal planar graphs are Hamiltonian
Thomas Böhme
,
Jochen Harant
,
Michal Tkác̑
Journal of Graph Theory
32
(4), 1999, pp. 405-410
The consecutive-4 digraphs are Hamiltonian
Gerard J. Chang
,
Frank K. Hwang
,
Li-Da Tong
Journal of Graph Theory
31
(1), 1999, pp. 1-6
Bipartite labeling of trees with maximum degree three
C. Paul Bonnington
,
Jozef S̑irán̑
Journal of Graph Theory
31
(1), 1999, pp. 7-15
Directed cycles with chords
Daniel A. Marcus
Journal of Graph Theory
31
(1), 1999, pp. 17-28
A semi-induced subgraph characterization of upper domination perfect graphs
Igor E. Zverovich
,
Vadim E. Zverovich
Journal of Graph Theory
31
(1), 1999, pp. 29-49
On wing-perfect graphs
Stefan Hougardy
Journal of Graph Theory
31
(1), 1999, pp. 51-66
On total 9-coloring planar graphs of maximum degree seven
Daniel P. Sanders
,
Yue Zhao
Journal of Graph Theory
31
(1), 1999, pp. 67-73
A survey of solved problems and applications on bandwidth, edgesum and profile of graphs
Yung-Ling Lai
,
Kenneth Williams
Journal of Graph Theory
31
(2), 1999, pp. 75-94
An excluded minor theorem for the octahedron
John Maharry
Journal of Graph Theory
31
(2), 1999, pp. 95-100
On 2-factors of a bipartite graph
Hong Wang
Journal of Graph Theory
31
(2), 1999, pp. 101-106
Longest cycles in tough graphs
H.A. Jung
,
P. Wittmann
Journal of Graph Theory
31
(2), 1999, pp. 107-127
On the linear arboricity of planar graphs
Jian-Liang Wu
Journal of Graph Theory
31
(2), 1999, pp. 129-134
P_4
decompositions of regular graphs
Katherine Heinrich
,
Jiping Liu
,
Minli Yu
Journal of Graph Theory
31
(2), 1999, pp. 135-143
Short odd cycles in 4-chromatic graphs
A. Nilli
Journal of Graph Theory
31
(2), 1999, pp. 145-147
The list colouring constants
Bruce Reed
Journal of Graph Theory
31
(2), 1999, pp. 149-153
A characterization of
P_4
-indifference graphs
Chính T. Hoàng
,
Frédéric Maffray
,
Marc Noy
Journal of Graph Theory
31
(3), 1999, pp. 155-162
Vertices contained in every minimum dominating set of a tree
C.M. Mynhardt
Journal of Graph Theory
31
(3), 1999, pp. 163-177
Seiten
<
1
2
3
4
>