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