default search action
Journal of Combinatorial Theory, Series B, Volume 72
Volume 72, Number 1, January 1998
- Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi:
Flows, View Obstructions, and the Lonely Runner. 1-9 - Xingxing Yu:
Subdivisions in Planar Graphs. 10-52 - Seiya Negami:
Ramsey-Type Theorems for Spatial Graphs and Good Drawings. 53-62 - Paul D. Seymour, Klaus Truemper:
A Petersen on a Pentagon. 63-79 - Vladimir P. Korzhik:
An Infinite Series of Surfaces with Known 1-Chromatic Number. 80-90 - Anthony J. W. Hilton, David S. G. Stirling, Tomaz Slivnik:
A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings. 91-103 - Carsten Thomassen:
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. 104-109 - Yu Qing Chen:
On Hamiltonicity of Vertex-Transitive Graphs and Digraphs of Orderp4. 110-121 - Alexander Schrijver:
Counting 1-Factors in Regular Bipartite Graphs. 122-135 - John Maharry:
A Splitter for Graphs with No Petersen Family Minor. 136-139 - Cai Heng Li:
The Solution of a Problem of Godsil on Cubic Cayley Graphs. 140-142 - Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Intersections of Longest Cycles in k-Connected Graphs. 143-149 - Paul D. Seymour:
A Note on List Arboricity. 150-151 - Thomas Niessen:
A Characterization of Graphs Having All (g, f)-Factors. 152-156 - Prasad Tetali:
A Characterization of Unique Tournaments. 157-159
Volume 72, Number 2, March 1998
- Tatsuya Tsukamoto:
Any Knot Is Inevitable in a Regular Projection of a Planar Graph. 161-180 - Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl:
2-Partition-Transitive Tournaments. 181-196 - Katherine Heinrich, Jiping Liu, Cun-Quan Zhang:
Triangle-Free Circuit Decompositions and Petersen Minor. 197-207 - Michael D. Plummer, Xiaoya Zha:
On the Connectivity of Graphs Embedded in Surfaces. 208-228 - Ioan Tomescu:
Chromatic Coefficients of Linear Uniform Hypergraphs. 229-235 - Tomás Feder, Pavol Hell:
List Homomorphisms to Reflexive Graphs. 236-250 - Jason I. Brown:
On the Roots of Chromatic Polynomials. 251-256 - Rudolf Halin:
A Note on k-Connected Rayless Graphs. 257-260
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.