Journal of Combinatorial Theory, Series B, Volume 43
Volume 43, Number 1, August 1987
Thomas Zaslavsky: Balanced decompositions of a signed graph. 1-13- Chris D. Godsil, John Shawe-Taylor: Distance-regularised graphs are distance-regular or distance-biregular. 14-24
- Gary L. Miller: An additivity theorem for the genus of a graph. 25-47
- R. Bruce Richter: On the non-orientable genus of a 2-connected graph. 48-59
- R. Bruce Richter: On the Euler genus of a 2-connected graph. 60-69
- Wen-Lian Hsu: Decomposition of perfect graphs. 70-94
- A. Khelladi: Nowhere-zero integral chains and flows in bidirected graphs. 95-115
- Carsten Thomassen: A characterization of locally finite vertex-transitive graphs. 116-119
Volume 43, Number 2, October 1987
- Pierre Duchet: Parity graphs are kernel-M-solvable. 121-126
- András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. 127-139
- James W. Walker: Strict refinement for graphs and digraphs. 140-150
- Alan Tucker: A reduction procedure for coloring perfect K4-free graphs. 151-172
- Douglas A. Miller: Oriented matroids from smooth manifolds. 173-186
- László Lovász: Matching structure and the matching lattice. 187-222
- Bruce A. Reed: A semi-strong Perfect Graph theorem. 223-240
- Gadi Moran: A remark on embedded bipartite graphs. 241-243
Volume 43, Number 3, December 1987
- Bill Jackson: A Chvátal-Erdös condition for hamilton cycles in digraphs. 245-252
- Didier Arquès: Relations fonctionnelles et dénombrement des cartes pointées sur le tore. 253-274
- Didier Arquès: Hypercartes pointées sur le tore: Décompositions et dénombrements. 275-286
- Kouhei Asano: On the genus and thickness of graphs. 287-292
- Ron Aharoni: Menger's theorem for countable graphs. 303-313
- Brenda L. Dietrich: A circuit set characterization of antimatroids. 314-321
- C. St. J. A. Nash-Williams: Amalgamations of almost regular edge-colourings of simple graphs. 322-342
- Yahya Ould Hamidoune: A note on minimal directed graphs with given girth. 343-348
- Vasek Chvátal: On the P4-structure of perfect graphs III. Partner decompositions. 349-353
- Ury Jamshy, André Raspaud, Michael Tarsi: Short circuit covers for regular matroids with a nowhere zero 5-flow. 354-357
- Kazumasa Nomura: An inequality between intersection numbers of a distance-regular graph. 358-359
- Chris D. Godsil, Ilia Krasikov, Yehuda Roditty: Reconstructing graphs from their k-edge deleted subgraphs. 360-363
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team