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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Domination in a graph with a 2-factor
Ken-ichi Kawarabayashi
,
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
52
(1), 2006, pp. 1-6
On connectivity in graphs with given clique number
Angelika Hellwig
,
Lutz Volkmann
Journal of Graph Theory
52
(1), 2006, pp. 7-14
Numbers of edges in supermagic graphs
Svetlana Drajinová
,
Jaroslav Ivanc̑o
,
Andrea Semanic̑ová
Journal of Graph Theory
52
(1), 2006, pp. 15-26
Signed graph factors and degree sequences
Dean Hoffman
,
Heather Jordon
Journal of Graph Theory
52
(1), 2006, pp. 27-36
Roots of cube polynomials of median graphs
Bos̑tjan Bres̑ar
,
Sandi Klavz̑ar
,
Riste S̑krekovski
Journal of Graph Theory
52
(1), 2006, pp. 37-50
Group chromatic number of planar graphs of girth at least 4
Hong-Jian Lai
,
Xiangwen Li
Journal of Graph Theory
52
(1), 2006, pp. 51-72
Sufficient conditions for
\lambda'
-optimality in graphs with girth
g
C. Balbuena
,
P. García-Vázquez
,
X. Marcote
Journal of Graph Theory
52
(1), 2006, pp. 73-86
How many graphs are unions of
k
-cliques?
Béla Bollobás
,
Graham R. Brightwell
Journal of Graph Theory
52
(2), 2006, pp. 87-107
Bounding the size of near hexagons with lines of size 3
Bart De Bruyn
Journal of Graph Theory
52
(2), 2006, pp. 108-122
On the asymptotic value of the choice number of complete multi-partite graphs
Nurit Gazit
,
Michael Krivelevich
Journal of Graph Theory
52
(2), 2006, pp. 123-134
Claw-decompositions and Ttutte-orientations
János Barát
,
Carsten Thomassen
Journal of Graph Theory
52
(2), 2006, pp. 135-146
On an anti-Ramsey problem of Burr, Erdŏs, Graham, and T. Soś
Gábor N. Sárközy
,
Stanley Selkow
Journal of Graph Theory
52
(2), 2006, pp. 147-156
Cycle lengths in graphs with large minimum degree
V. Nikiforov
,
R.H. Schelp
Journal of Graph Theory
52
(2), 2006, pp. 157-170
Iterated line graphs are maximally ordered
Martin Knor
,
L'udovít Niepel
Journal of Graph Theory
52
(2), 2006, pp. 171-180
Improper choosability of graphs and maximum average degree
Frédéric Havet
,
Jean-Sébastien Sereni
Journal of Graph Theory
52
(3), 2006, pp. 181-199
Antisymmetric flows on planar graphs
T.H. Marshall
Journal of Graph Theory
52
(3), 2006, pp. 200-210
Explicit constructions of triple systems for Ramsey-Turán problems
Dhruv Mubayi
,
Vera T. Sós
Journal of Graph Theory
52
(3), 2006, pp. 211-216
A characterization of weakly four-connected graphs
Tibor Jordán
Journal of Graph Theory
52
(3), 2006, pp. 217-229
Two-connected orientations of Eulerian graphs
Alex R. Berg
,
Tibor Jordán
Journal of Graph Theory
52
(3), 2006, pp. 230-242
Isomorphic factorization of the complete graph into Cayley digraphs
G.L. Chia
,
Poh-Hwa Ong
Journal of Graph Theory
52
(3), 2006, pp. 243-256
Rectangular and visibility representations of infinite planar graphs
Carsten Thomassen
Journal of Graph Theory
52
(3), 2006, pp. 257-265
The
k
-piece packing problem
David Hartvigsen
,
Pavol Hell
,
Jácint Szabó
Journal of Graph Theory
52
(4), 2006, pp. 267-293
On the circular chromatic number of circular partitionable graphs
Arnaud Pêcher
,
Xuding Zhu
Journal of Graph Theory
52
(4), 2006, pp. 294-306
On the strong circular 5-flow conjecture
Edita Mác̑ajová
,
André Raspaud
Journal of Graph Theory
52
(4), 2006, pp. 307-316
Rank-tolerance graph classes
Martin Charles Golumbic
,
Robert E. Jamison
Journal of Graph Theory
52
(4), 2006, pp. 317-340
Seiten 1
2
>