Volume 92,
Number 1,
September 2004
- Jean-Paul Doignon, Samuel Fiorini:
The facets and the symmetries of the approval-voting polytope.
1-12
- Jichang Wu, Xueliang Li, Jianji Su:
The number of removable edges in a 4-connected graph.
13-40
- Tomás Kaiser, Daniel Král, Riste Skrekovski:
A revival of the girth conjecture.
41-53
- James F. Geelen, Dillon Mayhew, Geoff Whittle:
Inequivalent representations of matroids having no U3, 6-minor.
55-67
- Hiroshi Suzuki:
Thin weakly distance-regular digraphs.
69-83
- Vladimir Nikiforov, Cecil C. Rousseau:
Large generalized books are p-good.
85-97
- Petr Kolman, Jirí Matousek:
Crossing number, pair-crossing number, and expansion.
99-113
- Robin Thomas, Barrett Walls:
Three-coloring Klein bottle graphs of girth five.
115-135
- Charles Dunn, Hal A. Kierstead:
A simple competitive graph coloring algorithm III.
137-150
- Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
Regular bipartite graphs with all 2-factors isomorphic.
151-161
- Peter Keevash, Dhruv Mubayi:
Stability theorems for cancellative hypergraphs.
163-175
Volume 92,
Number 2,
November 2004
Special Issue Dedicated to Professor W. T. Tutte
- Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
The interlace polynomial of a graph.
199-233
- Henning Bruhn:
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits.
235-256
- James G. Oxley, Charles Semple, Geoff Whittle:
The structure of the 3-separations of 3-connected matroids.
257-293
- Richard Kenyon, Scott Sheffield:
Dimers, tilings and trees.
295-317
- Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
The perfect matching polytope and solid bricks.
319-324
- Neil Robertson, Paul D. Seymour:
Graph Minors. XX. Wagner's conjecture.
325-357
- Norman Biggs:
Specht modules and chromatic polynomials.
359-377
- Genghua Fan, Xuezheng Lv, Pei Wang:
Cycles in 2-connected graphs.
379-394
- Marien Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
Graphs and digraphs with all 2-factors isomorphic.
395-404
Last update Tue Feb 14 04:20:27 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
