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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Extremal graphs in connectivity augmentation
Tibor Jordán
Journal of Graph Theory
31
(3), 1999, pp. 179-193
On the number of shredders
Tibor Jordán
Journal of Graph Theory
31
(3), 1999, pp. 195-200
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
Van H. Vu
Journal of Graph Theory
31
(3), 1999, pp. 201-226
The distribution of nodes of given degree in random trees
Michael Drmota
,
Bernhard Gittenberger
Journal of Graph Theory
31
(3), 1999, pp. 227-253
Generation of isospectral graphs
Lorenz Halbeisen
,
Norbert Hungerbühler
Journal of Graph Theory
31
(3), 1999, pp. 255-265
The edge chromatic number of a directed/mixed multigraph
Leonid S. Mel'nikov
,
Vadim G. Vizing
Journal of Graph Theory
31
(4), 1999, pp. 267-273
Variants of the Hajnal-Szemerédi theorem
Eldar Fischer
Journal of Graph Theory
31
(4), 1999, pp. 275-282
(n,e)
-graphs with maximum sum of squares of degrees
Uri N. Peled
,
Rossella Petreschi
,
Andrea Sterbini
Journal of Graph Theory
31
(4), 1999, pp. 283-295
A linear Vizing-like relation between the size and the domination number of a graph
Dieter Rautenbach
Journal of Graph Theory
31
(4), 1999, pp. 297-302
Seiten 1
2
>