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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructions of bipartite graphs from finite geometries
Keith E. Mellinger
,
Dhruv Mubayi
Journal of Graph Theory
49
(1), 2005, pp. 1-10
Factorizations and characterizations of induced-hereditary and compositive properties
Alastair Farrugia
,
Peter Mihók
,
R. Bruce Richter
,
Gabriel Semanivs̑in
Journal of Graph Theory
49
(1), 2005, pp. 11-27
Finite subgraphs of uncountably chromatic graphs
Péter Komjáth
,
Saharon Shelah
Journal of Graph Theory
49
(1), 2005, pp. 28-38
Semistrong edge coloring of graphs
András Gyárfás
,
Alice Hubenko
Journal of Graph Theory
49
(1), 2005, pp. 39-47
2-factors with prescribed and proscribed edges
R.E.L. Aldred
,
D.A. Holton
,
J. Sheehan
Journal of Graph Theory
49
(1), 2005, pp. 48-58
Arc reversal in Nonhamiltonian circulant oriented graphs
Jozef Jirásek
Journal of Graph Theory
49
(1), 2005, pp. 59-68
The acyclic edge chromatic number of a random
d
-regular graph is
d + 1
Jaroslav Nes̑etȓil
,
Nicholas C. Wormald
Journal of Graph Theory
49
(1), 2005, pp. 69-74
Graph minors and linkages
G. Chen
,
R.J. Gould
,
K. Kawarabayashi
,
F. Pfender
,
B. Wei
Journal of Graph Theory
49
(1), 2005, pp. 75-91
Heavy cycles passing through some specified vertices in weighted graphs
Jun Fujisawa
,
Kiyoshi Yoshimoto
,
Shenggui Zhang
Journal of Graph Theory
49
(2), 2005, pp. 93-103
On stability of the Hamiltonian index under contractions and closures
Liming Xiong
,
Zdenȇk Ryjác̑ek
,
Hajo Broersma
Journal of Graph Theory
49
(2), 2005, pp. 104-115
Detour-saturated graphs
Lowell W. Beineke
,
J.E. Dunbar
,
M. Frick
Journal of Graph Theory
49
(2), 2005, pp. 116-134
Two sufficient conditions for dominating cycles
Mei Lu
,
Huiqing Liu
,
Feng Tian
Journal of Graph Theory
49
(2), 2005, pp. 135-150
Unavoidable cycle lengths in graphs
Jacques Verstraete
Journal of Graph Theory
49
(2), 2005, pp. 151-167
A note on Ramsey numbers for books
Vladimir Nikiforov
,
Cecil C. Rousseau
Journal of Graph Theory
49
(2), 2005, pp. 168-176
Coloring graphs from lists with bounded size of their union
Daniel Král'
,
Jiȓí Sgall
Journal of Graph Theory
49
(3), 2005, pp. 177-186
A generalization of Turán's theorem
Benny Sudakov
,
Tibor Szabó
,
Van H. Vu
Journal of Graph Theory
49
(3), 2005, pp. 187-195
Nowhere zero 4-flow in regular matroids
Hong-Jian Lai
,
Xiangwen Li
,
Hoifung Poon
Journal of Graph Theory
49
(3), 2005, pp. 196-204
Spanning triangulations in graphs
Daniela Kühn
,
Deryk Osthus
Journal of Graph Theory
49
(3), 2005, pp. 205-233
Edge-face chromatic number and edge chromatic number of simple plane graphs
Rong Luo
,
Cun-Quan Zhang
Journal of Graph Theory
49
(3), 2005, pp. 234-256
A topological lower bound for the circular chromatic number of Schrijver graphs
Frédéric Meunier
Journal of Graph Theory
49
(4), 2005, pp. 257-261
Hamiltonicity and forbidden subgraphs in 4-connected graphs
Florian Pfender
Journal of Graph Theory
49
(4), 2005, pp. 262-272
Posets and planar graphs
Stefan Felsner
,
William T. Trotter
Journal of Graph Theory
49
(4), 2005, pp. 273-284
A linear Vizing-like relation relating the size and total domination number of a graph
Michael A. Henning
Journal of Graph Theory
49
(4), 2005, pp. 285-290
The Erdŏs-Sós conjecture for trees of diameter four
Andrew McLennan
Journal of Graph Theory
49
(4), 2005, pp. 291-301
Characterizing subgraphs of Hamming graphs
Sandi Klavz̑ar
,
Iztok Peterin
Journal of Graph Theory
49
(4), 2005, pp. 302-312
Seiten 1
2
>