default search action
Journal of Combinatorial Theory, Series B, Volume 69
Volume 69, Number 1, January 1997
- Anna Galluccio, Antonio Sassano:
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. 1-38 - Zhicheng Gao, Xingxing Yu:
Convex Programming and Circumference of 3-Connected Graphs of Low Genus. 39-51 - Carsten Thomassen:
The Genus Problem for Cubic Graphs. 52-58 - Kazuo Murota:
Matroid Valuation on Independent Sets. 59-78 - Robin Thomas, Xingxing Yu:
Five-Connected Toroidal Graphs Are Hamiltonian. 79-96 - Victor Chepoi:
Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof. 97-100
Volume 69, Number 2, March 1997
- Michael Molloy, Bruce A. Reed:
A Bound on the Strong Chromatic Index of a Graph, . 103-109 - Genghua Fan:
Extensions of Flow Theorems. 110-124 - Atsuhiro Nakamoto, Katsuhiro Ota:
Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities. 125-141 - Peter Niemeyer, Mark E. Watkins:
Geodetic Rays and Fibers in One-Ended Planar Graphs. 142-163 - Zbigniew Lonc:
Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial. 164-182 - Stanislaw J. Szarek, Michel Talagrand:
On the Convexified Sauer-Shelah Theorem. 183-192 - Brendan D. McKay, Stanislaw P. Radziszowski:
Subgraph Counting Identities and Ramsey Numbers. 193-209 - Penny E. Haxell:
Partitioning Complete Bipartite Graphs by Monochromatic Cycles, . 210-218 - Adrian O. Waller:
Simultaneously Colouring the Edges and Faces of Plane Graphs. 219-221 - Anders Yeo:
A Note on Alternating Cycles in Edge-Coloured Graphs. 222-225 - Marko Lovrecic Sarazin:
A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs. 226-229 - David Tankus, Michael Tarsi:
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. 230-233
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.