default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 26
Volume 26, Number 1, February 1979
- Kenneth Appel, Wolfgang Haken:
An unavoidable set of configurations in planar triangulations. 1-21 - Maurice Pouzet:
Relations non reconstructibles par leurs restrictions. 22-34 - Arthur M. Hobbs:
Maximal Hamiltonian cycles in squares of graphs. 35-49 - Arthur M. Hobbs:
Hamiltonian squares of cacti. 50-65 - Daniel S. Hirschberg, C. K. Wong:
Upper and lower bounds for graph-diameter problems with application to record allocation. 66-74 - George B. Purdy:
The minimum genus of a two-point universal graph. 75-77 - Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater:
Matchings and transversals in hypergraphs, domination and independence-in trees. 78-80 - Chang M. Bang, Henry Sharp Jr.:
Score vectors of tournaments. 81-84 - Ki Hang Kim, Fred W. Roush:
Words with prescribed adjacencies. 85-97 - K. R. Parthasarathy, G. Ravindra:
The validity of the strong perfect-graph conjecture for (K4-e)-free graphs. 98-100 - R. W. Deming:
Acyclic orientations of a graph and chromatic and independence numbers. 101-110 - Edward J. Farrell:
On a general class of graph polynomials. 111-122
Volume 26, Number 2, April 1979
- James G. Oxley:
On a packing problem for infinite graphs and independence spaces. 123-130 - David J. Pengelley, Mark Jungerman:
Index four orientable embeddings and case zero of the Heawood conjecture. 131-144 - M. O'Keefe, Pak-Ken Wong:
A smallest graph of girth 5 and valency 6. 145-149 - Jean-Luc Paillet:
A threshold property for intersections in a finite set. 150-153 - Mark Jungerman:
The nonorientable genus of the symmetric quadripartite graph. 154-158 - Paul D. Seymour
:
Matroid representation over GF(3). 159-173 - Robert E. Bixby:
On Reid's characterization of the ternary matroids. 174-204 - François Jaeger:
Flows and generalized coloring theorems in graphs. 205-216 - Nguyen Huy Xuong:
How to determine the maximum genus of a graph. 217-225 - Nguyen Huy Xuong:
Upper-embeddable graphs and related topics. 226-232 - Serge Hocquenghem:
Tabloïdes. 233-250 - Walter Whiteley:
Logic and invariant theory IV. Invariants and syzygies in combinatorial geometry. 251-267 - Paul A. Catlin:
Hajós' graph-coloring conjecture: Variations and counterexamples. 268-274
Volume 26, Number 3, June 1979
- Gyula O. H. Katona:
Obituary. 275 - Zsolt Baranyai:
The edge-coloring of complete hypergraphs I. 276-294 - Shawpawn Kumar Das:
A Euler-Poincaré characteristic for the open set lattices of finite topologies. 295-299 - Dragomir Z. Djokovic:
On regular graphs, V. 300-308 - Dragomir Z. Djokovic:
On regular graphs, VI. 309-316 - Jean A. Larson:
Some graphs with chromatic number three. 317-322 - Wilfried Imrich:
On the connectivity of cayley graphs. 323-326 - D. Kim, Ian G. Enting:
The limit of chromatic polynomials. 327-336 - R. J. Cook:
Vertex degrees of planar graphs. 337-345 - F. Göbel, A. A. Jagers:
On a conjecture of Tutte concerning minimal tree numbers. 346-348 - Alexander Schrijver:
Matroids and linking systems. 349-369 - Paul D. Seymour:
A short proof of the two-commodity flow theorem. 370-371 - A. J. W. Duijvestijn:
A lowest order simple perfect 2 × 1 squared rectangle. 372-374
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 2026-05-05 23:52 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:
