default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 90
Volume 90, Number 1, January 2004
- William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason:
To Adrian Bondy and U. S. R. Murty. 1 - Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp:
Balanced edge colorings. 3-20 - Jay Adamsson, R. Bruce Richter:
Arrangements, circular arrangements and the crossing number of C7X Cn. 21-39 - Peter Keevash, Benny Sudakov:
On the number of edges not covered by monochromatic copies of a fixed graph. 41-53 - Michael S. Lang:
A new inequality for bipartite distance-regular graphs. 55-91 - Charles L. Dunn
, Hal A. Kierstead:
A simple competitive graph coloring algorithm II. 93-106 - Daniel Král, Heinz-Jürgen Voss:
Edge-disjoint odd cycles in planar graphs. 107-120 - Thomas Q. Sibley:
On classifying finite edge colored graphs with two transitive automorphism groups. 121-138 - Martin Kochol:
Reduction of the 5-Flow Conjecture to cyclically 6-edge-connected snarks. 139-145 - Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West:
Homomorphisms from sparse graphs with large girth. 147-159 - Jaroslav Nesetril, Xuding Zhu:
On sparse graphs with given colorings and homomorphisms. 161-172 - Hongxun Qin, Xiangqian Zhou:
The class of binary matroids with no M(K3, 3)-, M ast (K3, 3)-, M(K5)- or M ast (K5)-minor . 173-184 - Jin Ho Kwak, Ju-Mok Oh:
Infinitely many finite one-regular graphs of any even valency. 185-191
Volume 90, Number 2, March 2004
- Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald:
Hamiltonian decompositions of random bipartite regular graphs. 195-222 - Paul R. Hafner:
Geometric realisation of the graphs of McKay-Miller-Sirán. 223-232 - Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana:
Weakly distance-regular digraphs. 233-255 - Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Square-free perfect graphs. 257-307 - David R. Wood:
Bounded degree acyclic decompositions of digraphs. 309-313 - Ken-ichi Kawarabayashi:
Cycles through a prescribed vertex set in N-connected graphs. 315-323 - Neil Robertson, Paul D. Seymour:
Graph Minors. XIX. Well-quasi-ordering on a surface. 325-385
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 2025-03-08 00:45 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:
