default search action
Journal of Combinatorial Theory, Series B, Volume 87
Volume 87, Number 1, January 2003
- Bojan Mohar, Alexander Schrijver:
Blocking nonorientability of a surface. 2-16 - Bill Jackson, Tibor Jordán:
Non-separable detachments of graphs. 17-37 - Carsten Thomassen:
The chromatic number of a graph of girth 5 on a fixed surface. 38-71 - Ron Aharoni, Tamás Fleiner:
On a lemma of Scarf. 72-80 - Anthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, Crispin St. John Alvah Nash-Williams:
Hamiltonian double latin squares. 81-129 - Thomas Andreae:
On immersions of uncountable graphs. 130-137 - Martin Funk
, Bill Jackson, Domenico Labbate
2-Factor hamiltonian graphs. 138-144 - Reinhard Diestel:
The countable Erds-Menger conjecture with ends. 145-161 - Dragan Marusic
On 2-arc-transitivity of Cayley graphs. 162-196 - Reinhard Diestel, Daniela Kühn:
Graph-theoretical versus topological ends of graphs. 197-206
Volume 87, Number 2, March 2003
- Jason I. Brown
The independence fractal of a graph. 209-230 - Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan:
Partitioning into graphs with only small components. 231-243 - Guoli Ding, Zhenzhen Xu, Wenan Zang:
Packing cycles in graphs, II. 244-253 - Daniel P. Sanders, Yue Zhao:
Coloring edges of graphs embedded in a surface of characteristic zero. 254-263 - James F. Geelen, Geoffrey P. Whittle:
Cliques in dense GF(q)-representable matroids. 264-269 - James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle:
Disjoint cocircuits in matroids with large rank. 270-279 - Yusheng Li, Wenan Zang:
Ramsey numbers involving large dense graphs and bipartite Turán numbers. 280-288 - Stéphane Bessy, Stéphan Thomassé
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. 289-299 - Michele Conforti, Gérard Cornuéjols:
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. 300-330 - Gérard Cornuéjols, Xinming Liu:
A class of perfect graphs containing P6. 331-347 - Feng Ming Dong
Bounds for mean colour numbers of graphs. 348-365 - Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp:
Graphs with large maximum degree containing no odd cycles of a given length. 366-373 - Alexandr V. Kostochka, Michael Stiebitz:
A new lower bound on the number of edges in colour-critical graphs and hypergraphs. 374-402
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.
last updated on 2024-12-15 01:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: