default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 25
Volume 25, Number 1, August 1978
- Maurice Pouzet:
Ensemble ordonné universel recouvert par deux chaines. 1-25 - László Babai
:
Infinite digraphs with given regular automorphism groups. 26-46 - Cornelis Hoede, Henk Jan Veldman:
On characterization of Hamiltonian graphs. 47-53 - Béla Bollobás:
Uniquely colorable graphs. 54-61 - Steve Alpern:
Superhamiltonian graphs. 62-73 - Wolfgang Mader:
Über n-fach zusammenhängende Eckenmengen in Graphen. 74-93 - Michael Doob:
Characterizations of regular magic graphs. 94-104
Volume 25, Number 2, October 1978
- Béla Bollobás, Stephen E. Eldridge:
Packings of graphs and applications to computational complexity. 105-124 - K. S. Vijayan:
On a class of distance transitive graphs. 125-129 - Darald J. Hartfiel, Carlton J. Maxson:
On a definition of connected sets of a matroid. 130-134 - Jay R. Goldman, James T. Joichi, Dennis E. White:
Rook theory III. Rook polynomials and the chromatic structure of graphs. 135-142 - Detlef Wille:
Enumeration of self-complementary structures. 143-150 - Gerald Berman:
Decomposition of graph functions. 151-165 - Arthur T. White:
Block designs and graph imbeddings. 166-183 - Douglas R. Woodall:
A sufficient condition for hamiltonian circuits. 184-186 - James B. Orlin:
Line-digraphs, arborescences, and theorems of tutte and knuth. 187-198 - Jon Folkman, Jim Lawrence:
Oriented matroids. 199-236 - Stephane Foldes:
The rotor effect can alter the chromatic polynomial. 237-239 - A. J. W. Duijvestijn:
Simple perfect squared square of lowest order. 240-243
Volume 25, Number 3, December 1978
- Mordechai Lewin:
On path connected graphs. 245-257 - Julie Sims, Derek A. Holton:
Stability of cartesian products. 258-282 - Michel Las Vergnas:
Bases in oriented matroids. 283-289 - Anthony J. W. Hilton, Rhys Price Jones:
Partitioning the edges of a graph. 290-294 - Norbert Sauer, Joel Spencer:
Edge disjoint placement of graphs. 295-302 - Herbert Pahlings:
On the chromatic number of skew graphs. 303-306 - Marie-Claude Heydemann:
Spectral characterization of some graphs. 307-312 - Colin McDiarmid:
Blocking, antiblocking, and pairs of matroids and polymatroids. 313-325 - Peter J. Slater:
A constructive characterization of trees with at least k disjoint maximum matchings. 326-338 - Frank Allaire, Edward Reinier Swart:
A systematic approach to the determination of reducible configurations in the four-color conjecture. 339-362 - Béla Bollobás:
The number of 1-factors in 2k-connected graphs. 363-366
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-12-27 21:26 CET 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:
