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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge-decompositions of
K_{n,n}
into isomorphic copies of a given tree
Anna Lladó
,
S.C. López
Journal of Graph Theory
48
(1), 2005, pp. 1-18
Graphs with independent perfect matchings
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Graph Theory
48
(1), 2005, pp. 19-50
Further results on the lower bounds of mean color numbers
F.M. Dong
Journal of Graph Theory
48
(1), 2005, pp. 51-73
Regular matroid decomposition via signed graphs
Jim Geelen
,
Bert Gerards
Journal of Graph Theory
48
(1), 2005, pp. 74-84
Detecting even holes
Maria Chudnovsky
,
Ken-ichi Kawarabayashi
,
Paul Seymour
Journal of Graph Theory
48
(2), 2005, pp. 85-111
Complete characterization of almost moore digraphs of degree three
Edy Tri Baskoro
,
Mirka Miller
,
Jozef S̑irán̑
,
Martin Sutton
Journal of Graph Theory
48
(2), 2005, pp. 112-126
On the number of maximal bipartite subgraphs of a graph
Jesper Makholm Byskov
,
Bolette Ammitzbll Madsen
,
Bjarke Skjernaa
Journal of Graph Theory
48
(2), 2005, pp. 127-132
Partitioning complete multipartite graphs by monochromatic trees
Atsushi Kaneko
,
M. Kano
,
Kazuhiro Suzuki
Journal of Graph Theory
48
(2), 2005, pp. 133-141
Hamiltonian
N_2
-locally connected claw-free graphs
Hong-Jian Lai
,
Yehong Shao
,
Mingquan Zhan
Journal of Graph Theory
48
(2), 2005, pp. 142-146
Four-cycles in graphs without a given even cycle
Daniela Kühn
,
Deryk Osthus
Journal of Graph Theory
48
(2), 2005, pp. 147-156
Multiple vertex coverings by cliques
Wayne Goddard
,
Michael A. Henning
Journal of Graph Theory
48
(2), 2005, pp. 157-167
Asymmetric graph coloring games
H.A. Kierstead
Journal of Graph Theory
48
(3), 2005, pp. 169-185
Circular perfect graphs
Xuding Zhu
Journal of Graph Theory
48
(3), 2005, pp. 186-209
Circular choosability of graphs
Xuding Zhu
Journal of Graph Theory
48
(3), 2005, pp. 210-218
All
(k;g)
-cages are
k
-edge-connected
Yuqing Lin
,
Mirka Miller
,
Chris Rodger
Journal of Graph Theory
48
(3), 2005, pp. 219-227
Sufficient conditions for graphs to be
\lambda'
-optimal, super-edge-connected, and maximally edge-connected
Angelika Hellwig
,
Lutz Volkmann
Journal of Graph Theory
48
(3), 2005, pp. 228-246
Infinite paths in planar graphs II, structures and ladder nets
Xingxing Yu
Journal of Graph Theory
48
(4), 2005, pp. 247-266
Hourglasses and Hamilton cycles in 4-connected claw-free graphs
Tomás̑ Kaiser
,
MingChu Li
,
Zdenȇk Ryjác̑ek
,
Liming Xiong
Journal of Graph Theory
48
(4), 2005, pp. 267-276
Disjoint clique cutsets in graphs without long holes
Elaine M. Eschen
,
Chính T. Hoàng
,
Mark D.T. Petrick
,
R. Sritharan
Journal of Graph Theory
48
(4), 2005, pp. 277-298
Hamilton cycles in strong products of graphs
Daniel Král'
,
Jana Maxová
,
Robert S̑ámal
,
Pavel Podbrdský
Journal of Graph Theory
48
(4), 2005, pp. 299-321
Isomorphism criterion for monomial graphs
Vasyl Dmytrenko
,
Felix Lazebnik
,
Raymond Viglione
Journal of Graph Theory
48
(4), 2005, pp. 322-328
Erratum to ''Fractional chromatic number and circular chromatic number for distance graphs with large clique size''
Daphne Der-Fen Liu
,
Xuding Zhu
Journal of Graph Theory
48
(4), 2005, pp. 329-330