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=32
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
Seiten
<
1
2