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=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A result on extendibility in the powers of graphs
Kara Walcher Shavo Shavo
Journal of Graph Theory
56
(1), 2007, pp. 1-22
Tough spiders
Tomás̑ Kaiser
,
Daniel Král
,
Ladislav Stacho
Journal of Graph Theory
56
(1), 2007, pp. 23-40
Universal graphs with a forbidden near-path or 2-bouquet
Gregory Cherlin
,
Lasse Tallgren
Journal of Graph Theory
56
(1), 2007, pp. 41-63
T
-joins intersecting small edge-cuts in graphs
Tomás̑ Kaiser
,
Riste S̑krekovski
Journal of Graph Theory
56
(1), 2007, pp. 64-71
Interval tournaments
David E. Brown
,
Arthur H. Busch
,
J. Richard Lundgren
Journal of Graph Theory
56
(1), 2007, pp. 72-81
On the chromatic spectrum of acyclic decompositions of graphs
Robert E. Jamison
,
Eric Mendelsohn
Journal of Graph Theory
56
(2), 2007, pp. 83-104
Cross-intersecting couples of graphs
Emanuela Fachini
,
János Körner
Journal of Graph Theory
56
(2), 2007, pp. 105-112
On the independence number of the Erdŏs-Rényi and projective norm graphs and a related hypergraph
Dhruv Mubayi
,
Jason Williford
Journal of Graph Theory
56
(2), 2007, pp. 113-127
The crossing number of
K_11
is 100
Shengjun R. Pan
,
Bruce Richter
Journal of Graph Theory
56
(2), 2007, pp. 128-134
Maximum number of colorings of
(2k, k^2)
-graphs
Felix Lazebnik
,
Oleg Pikhurko
,
Andrew Woldar
Journal of Graph Theory
56
(2), 2007, pp. 135-148
On graphs with subgraphs having large independence numbers
Noga Alon
,
Benny Sudakov
Journal of Graph Theory
56
(2), 2007, pp. 149-157
Vertex disjoint equivalent subgraphs of order 3
Tomoki Nakamigawa
Journal of Graph Theory
56
(3), 2007, pp. 159-166
Finite symmetric graphs with two-arc transitive quotients II
Zaiping Lu
,
Sanming Zhou
Journal of Graph Theory
56
(3), 2007, pp. 167-193
The average degree of an edge-chromatic critical graph II
Douglas R. Woodall
Journal of Graph Theory
56
(3), 2007, pp. 194-218
Independence number and clique minors
Ken-ichi Kawarabayashi
,
Zi-Xia Song
Journal of Graph Theory
56
(3), 2007, pp. 219-226
Compatible circuit decompositions of 4-regular graphs
Herbert Fleischner
,
François Genest
,
Bill Jackson
Journal of Graph Theory
56
(3), 2007, pp. 227-240
Ore-type condition for the existence of connected factors
Yunsun Nam
Journal of Graph Theory
56
(3), 2007, pp. 241-248
Hamilton cycles in prisms
Tomás̑ Kaiser
,
Zdenȇk Ryjác̑ek
,
Daniel Král'
,
Moshe Rosenfeld
,
Heinz-Jürgen Voss
Journal of Graph Theory
56
(4), 2007, pp. 249-269
The generalized Randić index of trees
Paul Balister
,
Béla Bollobás
,
Stefanie Gerke
Journal of Graph Theory
56
(4), 2007, pp. 270-286
On the crossing numbers of Cartesian products with trees
Drago Bokal
Journal of Graph Theory
56
(4), 2007, pp. 287-300
Constructing trees in graphs with no
K_{2,s}
Suman Balasubramanian
,
Edward Dobson
Journal of Graph Theory
56
(4), 2007, pp. 301-310
Hereditary properties of combinatorial structures: Posets and oriented graphs
József Balogh
,
Béla Bollobás
,
Robert Morris
Journal of Graph Theory
56
(4), 2007, pp. 311-332
Generating even triangulations of the projective plane
Yusuke Suzuki
,
Takahiro Watanabe
Journal of Graph Theory
56
(4), 2007, pp. 333-349