Discrete Mathematics, Volume 187

Volume 187, Numbers 1-3, June 1998

• Ashok T. Amin, Lane H. Clark, Peter J. Slater:
  Parity dimension for graphs. 1-17
  
• David W. Barnette:
  Contractible circuits in 3-connected graphs. 19-29
  
• A. Behr, L. Camarinopoulos:
  On the domination of hypergraphs by their edges. 31-38
  
• Brian Curtin:
  2-Homogeneous bipartite distance-regular graphs. 39-70
  
• Serge Dulucq, S. Gire, O. Guibert:
  A combinatorial proof of J. West's conjecture. 71-96
  
• Miroslav Fiedler:
  Additive compound graphs. 97-108
  
• David Forge, Jorge L. Ramírez Alfonsín:
  Connected coverings and an application to oriented matroids. 109-121
  
• David S. Herscovici, Aparna W. Higgins:
  The pebbling number of C₅ × C₅. 123-135
  
• Martin Juvan, Bojan Mohar, Riste Skrekovski:
  On list edge-colorings of subcubic graphs. 137-149
  
• Vsevolod F. Lev:
  On consecutive subset sums. 151-160
  
• Jixiang Meng, Mingyao Xu:
  On the isomorphism problem of Cayley graphs of Abelian groups. 161-169
  
• Dana Pascovici:
  On the forced unilateral orientation number of a graph. 171-183
  
• Dieter Rautenbach, Lutz Volkmann:
  The domatic number of block-cactus graphs. 185-193
  
• Yoomi Rho:
  An extremal problem concerning graphs not containing K_t and K_{t, n-t}. 195-209
  
• Bo-Ying Wang, Fuzhen Zhang:
  On the precise number of (0, 1)-matrices in U(R, R). 211-220
  
• Hong Wang:
  Vertex-disjoint hexagons with chords in a bipartite graph. 221-231
  
• Hong Wang:
  Triangles in claw-free graphs. 233-244
  
• Jovisa D. Zunic:
  Limit shape of convex lattice polygons having the minimal L_infinity diameter w.r.t. the number of their vertices. 245-254
  
• Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
  An Euler-type formula for median graphs. 255-258
  
• Géza Bohus, William Jockusch, Carl W. Lee, Nagabhushana Prabhu:
  On a triangulation of the 3-ball and the solid torus. 259-264
  
• Joseph E. Bonin:
  On basis-exchange properties for matroids. 265-268
  
• Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
  A characterization of strongly chordal graphs. 269-271
  
• B. Du:
  K_{1, p²}-factorization of complete bipartite graphs. 273-279
  
• George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard:
  Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex. 281-290
  
• Jun Kyo Kim, Sang Geun Hahn:
  A new upper bound for binary codes with minimum distance four. 291-295
  
• Emeric Deutsch:
  A bijection on Dyck paths and its consequences (note) [discrete math. 179 (1998) 253-256]. 297