Journal of Combinatorial Theory
, Series B, Volume 37
Volume 37, Number 1, August 1984
Ervin Györi
:
A minimax theorem on intervals.
1-9
Electronic Edition
(link)
BibTeX
Denis Naddef
:
Pancyclic properties of the graph of some 0-1 polyhedra.
10-26
Electronic Edition
(link)
BibTeX
Helge Tverberg
:
On Schmerl's effective version of Brooks' theorem.
27-30
Electronic Edition
(link)
BibTeX
Mikhail Deza
,
Peter Frankl
:
Injection geometries.
31-40
Electronic Edition
(link)
BibTeX
Denis Naddef
,
William R. Pulleyblank
:
Hamiltonicity in (0-1)-polyhedra.
41-52
Electronic Edition
(link)
BibTeX
G. R. T. Hendry
:
Maximum graphs with a unique
k
-factor.
53-63
Electronic Edition
(link)
BibTeX
Douglas Bauer
:
Extremal non-bipartite regular graphs of girth 4.
64-69
Electronic Edition
(link)
BibTeX
Robert E. Jamison
:
Monotonicity of the mean order of subtrees.
70-78
Electronic Edition
(link)
BibTeX
Noga Alon
,
S. Friedland
,
Gil Kalai
:
Regular subgraphs of almost regular graphs.
79-91
Electronic Edition
(link)
BibTeX
Noga Alon
,
S. Friedland
,
Gil Kalai
:
Every 4-regular graph plus an edge contains a 3-regular subgraph.
92-93
Electronic Edition
(link)
BibTeX
Geoffrey P. Whittle
:
On the critical exponent of transversal matroids.
94-95
Electronic Edition
(link)
BibTeX
Teluhiko Hilano
,
Kazumasa Nomura
:
Distance degree regular graphs.
96-100
Electronic Edition
(link)
BibTeX
Volume 37, Number 2, October 1984
Trevor I. Fenner
,
Alan M. Frieze
:
Hamiltonian cycles in random regular graphs.
103-112
Electronic Edition
(link)
BibTeX
Shlomo Moran
:
On the length of optimal TSP circuits in sets of bounded diameter.
113-141
Electronic Edition
(link)
BibTeX
S. Stueckle
,
Richard D. Ringeisen
:
Generalized petersen graphs which are cycle permutation graphs.
142-150
Electronic Edition
(link)
BibTeX
Haruko Okamura
:
Paths and edge-connectivity in graphs.
151-172
Electronic Edition
(link)
BibTeX
Aeryung Moon
:
The graphs
G
(
n
,
k
) of the Johnson Schemes are unique for
n
geq 20.
173-188
Electronic Edition
(link)
BibTeX
James G. Oxley
:
On singleton 1-rounded sets of matroids.
189-197
Electronic Edition
(link)
BibTeX
Volume 37, Number 3, December 1984
Ron Aharoni
:
A generalization of Tutte's 1-factor theorem to countable graphs.
199-209
Electronic Edition
(link)
BibTeX
Medha Dhurandhar
:
Characterization of quadratic and cubic sigma-polynomials.
210-220
Electronic Edition
(link)
BibTeX
Geng-Hua Fan
:
New sufficient conditions for cycles in graphs.
221-227
Electronic Edition
(link)
BibTeX
Robert C. Brigham
,
Ronald D. Dutton
:
Bounds on graph spectra.
228-234
Electronic Edition
(link)
BibTeX
Emo Welzl
:
Symmetric graphs and interpretations.
235-244
Electronic Edition
(link)
BibTeX
Carsten Thomassen
:
A refinement of Kuratowski's theorem.
245-253
Electronic Edition
(link)
BibTeX
Kathryn Fraughnaugh Jones
:
Independence in graphs with maximum degree four.
254-269
Electronic Edition
(link)
BibTeX
Bruce Hedman
:
Clique graphs of time graphs.
270-278
Electronic Edition
(link)
BibTeX
Jeff Kahn
:
A family of perfect graphs associated with directed graphs.
279-282
Electronic Edition
(link)
BibTeX
Abdelkader Khelladi
,
Charles Payan
:
Generalized
n
-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton.
283-289
Electronic Edition
(link)
BibTeX
Takao Asano
,
Takao Nishizeki
,
Paul D. Seymour
:
A note on nongraphic matroids.
290-293
Electronic Edition
(link)
BibTeX
George R. T. Hendry
:
Maximum non-path-connected graphs.
294-298
Electronic Edition
(link)
BibTeX
Copyright ©
Sun May 17 00:09:00 2009 by
Michael Ley
(
ley@uni-trier.de
)