Journal of Graph Theory, Volume 56

Volume 56, Number 1, September 2007

Kara Walcher Shavo:
A result on extendibility in the powers of graphs. 1-22
Tomás Kaiser, Daniel Král, Ladislav Stacho:
Tough spiders. 23-40
Gregory L. Cherlin, Lasse Tallgren:
Universal graphs with a forbidden near-path or 2-bouquet. 41-63
Tomás Kaiser, Riste Skrekovski:
T-joins intersecting small edge-cuts in graphs. 64-71
David E. Brown, Arthur H. Busch, J. Richard Lundgren:
Interval Tournaments. 72-81

Robert E. Jamison, Eric Mendelsohn:
On the chromatic spectrum of acyclic decompositions of graphs. 83-104
Emanuela Fachini, János Körner:
Cross-intersecting couples of graphs. 105-112
Dhruv Mubayi, Jason Williford:
On the independence number of the Erdös-Rényi and projective norm graphs and a related hypergraph. 113-127
Shengjun Pan, R. Bruce Richter:
The crossing number of K₁₁ is 100. 128-134
Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar:
Maximum number of colorings of (2k, k²)-graphs. 135-148
Noga Alon, Benny Sudakov:
On graphs with subgraphs having large independence numbers. 149-157

Tomoki Nakamigawa:
Vertex disjoint equivalent subgraphs of order 3. 159-166
Zaiping Lu, Sanming Zhou:
Finite symmetric graphs with two-arc transitive quotients II. 167-193
Douglas R. Woodall:
The average degree of an edge-chromatic critical graph II. 194-218
Ken-ichi Kawarabayashi, Zi-Xia Song:
Independence number and clique minors. 219-226
Herbert Fleischner, François Genest, Bill Jackson:
Compatible circuit decompositions of 4-regular graphs. 227-240
Yunsun Nam:
Ore-type condition for the existence of connected factors. 241-248

Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. 249-269
Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. 270-286
Drago Bokal:
On the crossing numbers of Cartesian products with trees. 287-300
Suman Balasubramanian, Edward Dobson:
Constructing trees in graphs with no K_{2, s}. 301-310
József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. 311-332
Yusuke Suzuki, Takahiro Watanabe:
Generating even triangulations of the projective plane. 333-349

Last update Wed May 22 17:58:22 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page