Discrete Mathematics, Volume 280

Volume 280, Number 1-3, April 2004

• Guoli Ding, Peter P. Chen:
  Unavoidable doubly connected large graphs. 1-12
  
• Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
  Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. 13-27
  
• Adilson Gonçalves, Emerson L. Monte Carmelo:
  Some geometric structures and bounds for Ramsey numbers. 29-38
  
• David J. Grynkiewicz:
  On some Rado numbers for generalized arithmetic progressions. 39-50
  
• Patrick Healy, Ago Kuusik, Sebastian Leipert:
  A characterization of level planar graphs. 51-63
  
• Petteri Kaski, Patric R. J. Östergård:
  Miscellaneous classification results for 2-designs. 65-75
  
• Manoel Lemos, James G. Oxley:
  On the minor-minimal 2-connected graphs having a fixed minor. 77-118
  
• Nicolas Lichiardopol:
  Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph. 119-131
  
• Aleksander Malnic, Dragan Marusic, Primoz Potocnik, Changqun Wang:
  An infinite family of cubic edge- but not vertex-transitive graphs. 133-148
  
• Bernd S. W. Schröder:
  More examples on ordered set reconstruction. 149-163
  
• Zvezdelina Stankova, Julian West:
  Explicit enumeration of 321, hexagon-avoiding permutations. 165-189
  
• Eckhard Steffen:
  Measurements of edge-uncolorability. 191-214
  

• Cristina Bazgan:
  A note on the approximability of the toughness of graphs. 215-218
  
• Maurits de Graaf:
  Directed triangles in directed graphs. 219-223
  
• Emeric Deutsch:
  Enumerating symmetric directed convex polyominoes. 225-231
  
• Nicholas A. Loehr:
  Note on André's reflection principle. 233-236
  
• Dingjun Lou, Dongning Rao:
  Graphs with no M-alternating path between two vertices. 237-240
  
• Haruhide Matsuda:
  Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle. 241-250
  
• S. Nicoloso:
  Sum coloring and interval graphs: a tight upper bound for the minimum number of colors. 251-257
  
• Ignacio M. Pelayo:
  Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41-54]. 259-263
  
• Erfang Shan, Liying Kang:
  A note on balance vertices in trees. 265-269
  
• Van Bang Le, Jeremy Spinrad:
  Consequences of an algorithm for bridged graphs. 271-274