default search action
Journal of Combinatorial Theory, Series B, Volume 67
Volume 67, Number 1, May 1996
- S. E. Markossian, G. S. Gasparian, Bruce A. Reed:
beta-Perfect Graphs. 1-11 - C. Paul Bonnington, Wilfried Imrich, Norbert Seifter:
Geodesics in Transitive Graphs. 12-33 - Martin Kochol:
Snarks without Small Cycles. 34-47 - Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. 48-61 - András Sebö:
On Critical Edges in Minimal Imperfect Graphs. 62-85 - Norbert Polat:
Ends and Multi-Endings, I. 86-110 - Boris G. Pittel, Joel Spencer, Nicholas C. Wormald:
Sudden Emergence of a Giantk-Core in a Random Graph. 111-151 - Hong Wang:
On the Maximum Number of Independent Cycles in a Bipartite Graph. 152-164
Volume 67, Number 2, July 1996
- Genghua Fan, Henry A. Kierstead:
Hamiltonian Square-Paths. 167-182 - Atsuhiro Nakamoto:
Irreducible Quadrangulations of the Torus. 183-201 - Atsuhiro Nakamoto:
Diagonal Transformations and Cycle Parities of Quadrangulations on Surfaces. 202-211 - Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs. 212-237 - Kiran S. Kedlaya:
Outerplanar Partitions of Planar Graphs. 238-248 - Roman Nedela, Martin Skoviera:
Regular Embeddings of Canonical Double Coverings of Graphs. 249-277 - Makoto Araya, Akira Hiraki, Aleksandar Jurisic:
Distance-Regular Graphs with bt=1 and Antipodal Double-Covers. 278-283 - Kazumasa Nomura:
Spin Models on Triangle-Free Connected Graphs. 284-295 - Kiran B. Chilakamarri, Peter Hamburger, Raymond E. Pippert:
Hamilton Cycles in Planar Graphs and Venn Diagrams. 296-303 - Michael Tarsi:
Graphs Where Every Maximal Path Is Maximum. 304-324 - James G. Oxley, Dirk L. Vertigan, Geoffrey P. Whittle:
On Inequivalent Representations of Matroids over Finite Fields. 325-343
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.