Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 Kn. 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 K2m*, 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, Bjarne Toft:
The enumeration problem for color critical linear hypergraphs. 106-115 - Chris 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
Volume 29, Number 2, October 1980
- 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
Volume 29, Number 3, December 1980
- 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 - Torrence 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 - William 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
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
