Journal 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- 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
- 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
- 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
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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team