Volume 43, Number 1, May 2003

• 
  Xuechao Li, Cun-Quan Zhang: Chords of longest circuits of graphs embedded in torus and Klein bottle. 1-23
• 
  Etienne Birmelé: Tree-width and circumference of graphs. 24-25
• 
  Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota: 2-connected 7-coverings of 3-connected graphs on surfaces. 26-36
• 
  Zdenek Ryjácek, Richard H. Schelp: Contractibility techniques as a closure concept. 37-48
• 
  Mike Daven, Jim A. MacDougall, C. A. Rodger: Maximal sets of hamilton cycles in complete multipartite graphs. 49-66
• 
  Alex R. Berg, Bill Jackson, Tibor Jordán: Highly edge-connected detachments of graphs and digraphs. 67-77

Volume 43, Number 2, June 2003

• 
  Dominique Bénard, André Bouchet, R. B. Richter: Fold-2-covering triangular embeddings. 79-92
• 
  Wilfried Imrich, Riste Skrekovski: A theorem on integer flows on cartesian products of graphs. 93-98
• 
  Anthony Bonato, Claude Tardif: Large families of mutually embeddable vertex-transitive graphs. 99-106
• 
  Bojan Mohar: Circular colorings of edge-weighted graphs. 107-116
• 
  L. Caccetta, S. EL-Batanouny, J. Huang: On vertex critical graphs with prescribed diameter. 117-131
• 
  Anthony J. W. Hilton, Matthew Johnson: An algorithm for finding factorizations of complete graphs. 132-136
• 
  Francis K. Bell: Line graphs of bipartite graphs with Hamiltonian paths. 137-149
• 
  Peter F. Stadler: Minimum cycle bases of Halin graphs. 150-155
• 
  Jirí Fiala: NP completeness of the edge precoloring extension problem on bipartite graphs. 156-160

Volume 43, Number 3, July 2003

• 
  Tao Jiang, Seog-Jin Kim, Douglas B. West: Isometric cycles, cutsets, and crowning of bridged graphs. 161-170
• 
  Miguel Angel Fiol, Joan Gimbert, José Gómez, Yaokun Wu: On Moore bipartite digraphs. 171-187
• 
  Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer: Two-factors each component of which contains a specified vertex. 188-198
• 
  Joel Foisy: A newly recognized intrinsically knotted graph. 199-209
• 
  Ioan Tomescu: Maximal σ-polynomials of connected 3-chromatic graphs. 210-222
• 
  Donald A. Nelson: The structure of saturated critical blocks. 223-237

Volume 43, Number 4, August 2003

• 
  Noga Alon, Michael Krivelevich, Benny Sudakov: Induced subgraphs of prescribed size. 239-251
• 
  Roland Lortz, Ingrid Mengersen: Off-diagonal and asymptotic results on the Ramsey number r(K_{2, m}, K_{2, n}). 252-268
• 
  Atsushi Kaneko, Kiyoshi Yoshimoto: A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. 269-279
• 
  Norbert Polat: On constructible graphs, locally Helly graphs, and convexity. 280-298
• 
  Elena Grigorescu: Decreasing the diameter of cycles. 299-303
• 
  Zhishi Pan, Xuding Zhu: Construction of graphs with given circular flow numbers. 304-318
• 
  Youngsik Huh, Seungsang Oh: Planar graphs producing no strongly almost trivial embedding. 319-326

last updated on Wed May 22 05:54:37 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page