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 YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum packings of the complete graph with uniform length cycles
Daniel Horsley
Journal of Graph Theory
68
(1), 2011, pp. 1-7
On a theorem of Goldberg
J.M. McDonald
Journal of Graph Theory
68
(1), 2011, pp. 8-21
On bipartite 2-factorizations of
k_n-I
and the Oberwolfach problem
Darryn Bryant
,
Peter Danziger
Journal of Graph Theory
68
(1), 2011, pp. 22-37
On partitioning interval graphs into proper interval subgraphs and related problems
Frédéric Gardi
Journal of Graph Theory
68
(1), 2011, pp. 38-54
Circumferences of
k
-connected graphs involving independence numbers
Guantao Chen
,
Zhiquan Hu
,
Yaping Wu
Journal of Graph Theory
68
(1), 2011, pp. 55-76
The existence of a 2-factor in
K_{1, n}
-free graphs with large connectivity and large edge-connectivity
R.E.L. Aldred
,
Yoshimi Egawa
,
Jun Fujisawa
,
Katsuhiro Ota
,
Akira Saito
Journal of Graph Theory
68
(1), 2011, pp. 77-89
On graphs and algebraic graphs that do not contain cycles of length 4
Noga Alon
,
H. Tracy Hall
,
Christian Knauer
,
Rom Pinchasi
,
Raphael Yuster
Journal of Graph Theory
68
(2), 2011, pp. 91-102
Characterizing directed path graphs by forbidden asteroids
Kathie Cameron
,
Chính T. Hoàng
,
Benjamin Lévêque
Journal of Graph Theory
68
(2), 2011, pp. 103-112
On the complexity of reconstructing
H
-free graphs from their Star Systems
Fedor V. Fomin
,
Jan Kratochvíl
,
Daniel Lokshtanov
,
Federico Mancini
,
Jan Arne Telle
Journal of Graph Theory
68
(2), 2011, pp. 113-124
The equivalence of two conjectures of Berge and Fulkerson
G. Mazzuoccolo
Journal of Graph Theory
68
(2), 2011, pp. 125-128
The number of defective colorings of graphs on surfaces
Tom Rackham
Journal of Graph Theory
68
(2), 2011, pp. 129-136
When every
k
-cycle has at least
f(k)
chords
Terry A. McKee
Journal of Graph Theory
68
(2), 2011, pp. 137-147
Finding
\Delta(\Sigma)
for a surface
\sigma
of characteristic
\chi(\Sigma) = -5
Rong Luo
,
Yue Zhao
Journal of Graph Theory
68
(2), 2011, pp. 148-168
Acyclic 5-choosability of planar graphs without adjacent short cycles
O.V. Borodin
,
A.O. Ivanova
Journal of Graph Theory
68
(2), 2011, pp. 169-176
On Hamiltonian cycles in the prism over the odd graphs
Letícia R. Bueno
,
Peter Horák
Journal of Graph Theory
68
(3), 2011, pp. 177-188
Snarks with given real flow numbers
Robert Lukot'ka
,
Martin S̑koviera
Journal of Graph Theory
68
(3), 2011, pp. 189-201
A new upper bound for the independence number of edge chromatic critical graphs
Rong Luo
,
Yue Zhao
Journal of Graph Theory
68
(3), 2011, pp. 202-212
Re-embedding structures of 4-connected projective-planar graphs
Yusuke Suzuki
Journal of Graph Theory
68
(3), 2011, pp. 213-228
The plane-width of graphs
Marcin Kamiński
,
Paul Medvedev
,
Martin Milanic̑
Journal of Graph Theory
68
(3), 2011, pp. 229-245
A note on the girth-doubling construction for polygonal graphs
Ákos Seress
,
Eric Swartz
Journal of Graph Theory
68
(3), 2011, pp. 246-254
Vertex colorings of graphs without short odd cycles
Andrzej Dudek
,
Reshma Ramadurai
Journal of Graph Theory
68
(3), 2011, pp. 255-264
Small vertex-transitive and Cayley graphs of girth six and given degree: An algebraic approach
Eyal Loz
,
Martin Mac̑aj
,
Mirka Miller
,
Jana S̑iagiová
,
Jozef S̑irán̑
,
Jana Tomanová
Journal of Graph Theory
68
(4), 2011, pp. 265-284
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
MingChu Li
,
Xiaodong Chen
,
Hajo Broersma
Journal of Graph Theory
68
(4), 2011, pp. 285-298
Disjoint Hamilton cycles in the random geometric graph
Tobias Müller
,
Xavier Pérez-Giménez
,
Nicholas Wormald
Journal of Graph Theory
68
(4), 2011, pp. 299-322
Near-automorphisms of paths
Gerard J. Chang
Journal of Graph Theory
68
(4), 2011, pp. 323-325
Seiten 1
2
3
4
>