Journal of Combinatorial Theory, Series B, Volume 29

Volume 29, Number 1, August 1980

Michael O. Albertson, David M. Berman:
The chromatic difference sequence of a graph. 1-12
Monroe M. Newborn, William O. J. Moser:
Optimal crossing-free Hamiltonian circuit drawings of K_n. 13-26
Bill Jackson:
Hamilton cycles in regular 2-connected graphs. 27-46
László Lovász, Jaroslav Nesetril, Ales Pultr:
On a product dimension of graphs. 47-67
Timothy W. Tillson:
A Hamiltonian decomposition of K_2m^*, 2m >= 8. 68-74
Robert Donaghey:
Automorphisms on Catalan trees and bracketings. 75-90
M. O'Keefe, P. K. Wong:
A smallest graph of girth 10 and valency 3. 91-105
H. L. Abbott, A. Liu, B. Toft:
The enumeration problem for color critical linear hypergraphs. 106-115
C. D. Godsil:
Neighbourhoods of transitive graphs and GRR's. 116-140
F. Göbel:
On a 1-1-correspondence between rooted trees and natural numbers. 141-143

Herbert Fleischner:
Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. 145-167
Neil L. White:
The transcendence degree of a coordinatization of a combinatorial geometry. 168-175
András Frank:
On chain and antichain families of a partially ordered set. 176-184
Charles H. C. Little:
A characterization of planar cubic graphs. 185-194
Dragomir Z. Djokovic, Gary L. Miller:
Regular groups of automorphisms of cubic graphs. 195-230
Michel Las Vergnas:
Convexity in oriented matroids. 231-243
Carsten Thomassen:
Planarity and duality of finite and infinite graphs. 244-271
R. D. Boyle:
Reconstructing some bipartite graphs from their spanning trees. 272-275

Andreas Blass, Frank Harary, Zevi Miller:
Which trees are link graphs? 277-292
Giovanni Criscuolo, Chung-Mo Kwok, Abbe Mowshowitz, Roberto Tortora:
The group and the minimal polynomial of a graph. 293-302
Roger C. Entringer, Henda C. Swart:
Spanning cycles of nearly cubic graphs. 303-309
T. D. Parsons:
Circulant graph imbeddings. 310-320
J.-C. Fournier:
Isomorphismes d'hypergraphes par intersections équicardinales d'arêtes et configurations exclues. 321-327
Claude Benzaken:
Critical hypergraphs for the weak chromatic number. 328-338
W. G. Bridges, Sam Toueg:
On the impossibility of Directed Moore Graphs. 339-341
Stephane Foldes, Richard Steinberg:
A topological space for which graph embeddability is undecidable. 342-344
Stanley Wagon:
A bound on the chromatic number of graphs without certain induced subgraphs. 345-346

Last update Tue Feb 14 04:20:28 2012 CET by the DBLP Team —

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