Journal of Combinatorial Theory, Series B, Volume 37
Volume 37, Number 1, August 1984
Ervin Györi: A minimax theorem on intervals. 1-9- Denis Naddef: Pancyclic properties of the graph of some 0-1 polyhedra. 10-26
- Helge Tverberg: On Schmerl's effective version of Brooks' theorem. 27-30
- G. R. T. Hendry: Maximum graphs with a unique k-factor. 53-63
- Douglas Bauer: Extremal non-bipartite regular graphs of girth 4. 64-69
- Robert E. Jamison: Monotonicity of the mean order of subtrees. 70-78
- Noga Alon, Shmuel Friedland, Gil Kalai: Every 4-regular graph plus an edge contains a 3-regular subgraph. 92-93
- Geoffrey P. Whittle: On the critical exponent of transversal matroids. 94-95
Volume 37, Number 2, October 1984
- Shlomo Moran: On the length of optimal TSP circuits in sets of bounded diameter. 113-141
- S. Stueckle, Richard D. Ringeisen: Generalized petersen graphs which are cycle permutation graphs. 142-150
- Haruko Okamura: Paths and edge-connectivity in graphs. 151-172
- Aeryung Moon: The graphs G(n, k) of the Johnson Schemes are unique for n geq 20. 173-188
- James G. Oxley: On singleton 1-rounded sets of matroids. 189-197
Volume 37, Number 3, December 1984
- Ron Aharoni: A generalization of Tutte's 1-factor theorem to countable graphs. 199-209
- Medha Dhurandhar: Characterization of quadratic and cubic sigma-polynomials. 210-220
- Geng-Hua Fan: New sufficient conditions for cycles in graphs. 221-227
- Emo Welzl: Symmetric graphs and interpretations. 235-244
- Carsten Thomassen: A refinement of Kuratowski's theorem. 245-253
- Kathryn Fraughnaugh Jones: Independence in graphs with maximum degree four. 254-269
- Bruce Hedman: Clique graphs of time graphs. 270-278
- Jeff Kahn: A family of perfect graphs associated with directed graphs. 279-282
- Abdelkader Khelladi, Charles Payan: Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton. 283-289
- George R. T. Hendry: Maximum non-path-connected graphs. 294-298
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team