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=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Turán's theorem and
k
-connected graphs
Nicolas Bougard
,
Gwenaël Joret
Journal of Graph Theory
58
(1), 2008, pp. 1-13
Ore-type degree conditions for a graph to be
H
-linked
Alexandr V. Kostochka
,
Gexin Yu
Journal of Graph Theory
58
(1), 2008, pp. 14-26
Coupled choosability of plane graphs
Weifan Wang
,
Ko-Wei Lih
Journal of Graph Theory
58
(1), 2008, pp. 27-44
A better bound for the cop number of general graphs
Ehsan Chiniforooshan
Journal of Graph Theory
58
(1), 2008, pp. 45-48
Maximizing the number of independent subsets over trees with bounded degree
Clemens Heuberger
,
Stephan G. Wagner
Journal of Graph Theory
58
(1), 2008, pp. 49-68
Neighborhood hypergraphs of bipartite graphs
Endre Boros
,
Vladimir Gurvich
,
Igor Zverovich
Journal of Graph Theory
58
(1), 2008, pp. 69-95
Contractible elements in
k
-connected graphs not containing some specified graphs
Shinya Fujita
,
Ken-ichi Kawarabayashi
Journal of Graph Theory
58
(2), 2008, pp. 97-109
New bounds for the chromatic number of graphs
Manouchehr Zaker
Journal of Graph Theory
58
(2), 2008, pp. 110-122
On the editing distance of graphs
Maria Axenovich
,
André Kézdy
,
Ryan Martin
Journal of Graph Theory
58
(2), 2008, pp. 123-138
A conjecture of Borodin and a coloring of Grünbaum
Dieter Rautenbach
Journal of Graph Theory
58
(2), 2008, pp. 139-147
An improved bound for the strong chromatic number
P.E. Haxell
Journal of Graph Theory
58
(2), 2008, pp. 148-158
Extremal functions for rooted minors
Paul Wollan
Journal of Graph Theory
58
(2), 2008, pp. 159-178
Cycles passing through
k + 1
vertices in
k
-connected graphs
Jun Fujisawa
,
Tomoki Yamashita
Journal of Graph Theory
58
(2), 2008, pp. 179-190
A characterization of the degree sequences of 2-trees
Prosenjit Bose
,
Vida Dujmovi
,
Danny Krizanc
,
Stefan Langerman
,
Pat Morin
,
David R. Wood
,
Stefanie Wuhrer
Journal of Graph Theory
58
(3), 2008, pp. 191-209
The linear arboricity of planar graphs of maximum degree seven is four
Jian-Liang Wu
,
Yu-Wen Wu
Journal of Graph Theory
58
(3), 2008, pp. 210-220
Odd-angulated graphs and cancelling factors in box products
Zhongyuan Che
,
Karen L. Collins
,
Claude Tardif
Journal of Graph Theory
58
(3), 2008, pp. 221-238
On minimum sets of 1-factors covering a complete multipartite graph
David Cariolaro
,
Hung-Lin Fu
Journal of Graph Theory
58
(3), 2008, pp. 239-250
Disjoint quasi-kernels in digraphs
Scott Heard
,
Jing Huang
Journal of Graph Theory
58
(3), 2008, pp. 251-260
On two questions about circular choosability
Serguei Norine
Journal of Graph Theory
58
(3), 2008, pp. 261-269
Straight line embeddings of cubic planar graphs with integer edge lengths
Jim Geelen
,
Anjie Guo
,
David McKinnon
Journal of Graph Theory
58
(3), 2008, pp. 270-274
On self-immersions of infinite graphs
Thomas Andreae
Journal of Graph Theory
58
(4), 2008, pp. 275-285
Decompositions of highly connected graphs into paths of length 3
Carsten Thomassen
Journal of Graph Theory
58
(4), 2008, pp. 286-292
Every longest circuit of a 3-connected,
K_{3,3}
-minor free graph has a chord
Etienne Birmelé
Journal of Graph Theory
58
(4), 2008, pp. 293-298
Irregularity strength of dense graphs
Bill Cuckler
,
Felix Lazebnik
Journal of Graph Theory
58
(4), 2008, pp. 299-313
Hamiltonian threshold for strong products of graphs
Daniel Král'
,
Ladislav Stacho
Journal of Graph Theory
58
(4), 2008, pp. 314-328
Seiten 1
2
>