![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 85
Volume 85, Number 1, May 2002
- C. Paul Bonnington
, Marston D. E. Conder
, Margaret Morton, Patricia A. McKenna:
Embedding Digraphs on Orientable Surfaces. 1-20 - Thor Johnson, Robin Thomas:
Generating Internally Four-Connected Graphs. 21-58 - Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice. 59-93 - Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph. 94-136 - Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic. 137-180 - Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt:
Distance Graphs with Finite Chromatic Number. 181-187
Volume 85, Number 2, July 2002
- Richard A. Brualdi, Jian Shen:
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs. 189-196 - Robin S. Sanders:
Products of Circulant Graphs Are Metacirculant. 197-206 - Ken-ichi Kawarabayashi:
Contractible Edges and Triangles in k-Connected Graphs. 207-221 - Yoshiyasu Ishigami:
Proof of a Conjecture of Bolloba's and Kohayakawa on the Erds-Stone Theorem. 222-254 - Alexander Schrijver:
A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs. 255-260 - Béla Bollobás:
Evaluations of the Circuit Partition Polynomial. 261-268 - Steve Wilson:
Families of Regular Graphs in Regular Maps. 269-289 - C. David Leach, Christopher A. Rodger:
Fair Hamilton Decompositions of Complete Multipartite Graphs. 290-296 - Iiro S. Honkala, Antoine Lobstein:
On the Density of Identifying Codes in the Square Lattice. 297-306 - André Kündgen
, Radhika Ramamurthi:
Coloring Face-Hypergraphs of Graphs on Surfaces. 307-337 - Thomas Böhme, Bojan Mohar, Carsten Thomassen:
Long Cycles in Graphs on a Fixed Surface. 338-347 - Daniel P. Sanders, Yue Zhao:
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. 348-360 - Tao Jiang:
Anti-Ramsey Numbers of Subdivided Graphs. 361-366
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.