Discrete Mathematics, Volume 273

Volume 273, Number 1-3, December 2003

• Jaroslav Nesetril, Marc Noy, Oriol Serra:
  Foreword. 1-6
  Electronic Edition (link) BibTeX
• Guest Editors. 7- BibTeX
• Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
  Extremal problems under dimension constraints. 9-21
  Electronic Edition (link) BibTeX
• Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
  Maximal antichains under dimension constraints. 23-29
  Electronic Edition (link) BibTeX
• Noga Alon:
  Problems and results in extremal combinatorics--I. 31-53
  Electronic Edition (link) BibTeX
• Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
  Vertices of degree 6 in a contraction critically 6-connected graph. 55-69
  Electronic Edition (link) BibTeX
• Alex R. Berg, Bill Jackson, Tibor Jordán:
  Edge splitting and connectivity augmentation in directed hypergraphs. 71-84
  Electronic Edition (link) BibTeX
• Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
  Chordal embeddings of planar graphs. 85-102
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  Random strongly regular graphs? 103-114
  Electronic Edition (link) BibTeX
• Cyril Gavoille, Christophe Paul:
  Distance labeling scheme and split decomposition. 115-130
  Electronic Edition (link) BibTeX
• Daniel Krob, Jean Mairesse, Ioannis Michos:
  Computing the average parallelism in trace monoids. 131-162
  Electronic Edition (link) BibTeX
• Uwe Leck:
  On the orthogonal product of simplices and direct products of truncated Boolean lattices. 163-172
  Electronic Edition (link) BibTeX
• Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
  A note on random homomorphism from arbitrary graphs to Z. 173-181
  Electronic Edition (link) BibTeX
• Colin McDiarmid, Bruce A. Reed:
  Channel assignment on graphs of bounded treewidth. 183-192
  Electronic Edition (link) BibTeX
• Oleg Pikhurko:
  Further asymptotic size Ramsey results obtained via linear programming. 193-202
  Electronic Edition (link) BibTeX
• Robert Sámal:
  Antisymmetric flows and strong oriented coloring of planar graphs. 203-209
  Electronic Edition (link) BibTeX
• Susumu Suzuki, Toshihide Ibaraki:
  Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. 211-220
  Electronic Edition (link) BibTeX
• David R. Wood:
  Geometric thickness in a grid. 221-234
  Electronic Edition (link) BibTeX
• Nicholas C. Wormald:
  Analysis of greedy algorithms on graphs with bounded degrees. 235-260
  Electronic Edition (link) BibTeX
• Hong-Gwa Yeh, Xuding Zhu:
  4-Colorable 6-regular toroidal graphs. 261-274
  Electronic Edition (link) BibTeX