Discrete Applied Mathematics, Volume 51

Volume 51, Number 1-2, 1994

• Ulrich Faigle, Kees Hoede:
  Preface. 1
  
• Luitpold Babel, Gottfried Tinhofer:
  Hard-to-color Graphs for Connected Sequential Colorings. 3-25
  
• Ulrike Baumann:
  on Edge-hamiltonian Cayley Graphs. 27-37
  
• Hajo Broersma, Ingo Schiermeyer:
  Subgraphs, Closures and Hamiltonicity. 39-46
  
• Elias Dahlhaus:
  A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. 47-61
  
• Peter Damaschke:
  PLA Folding in Special Graph Classes. 63-74
  
• Peter Dankelmann:
  Average Distance and Independence Number. 75-83
  
• Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon:
  Constructing Colorings for Diagrams. 85-93
  
• Evelyne Flandrin, Jean-Luc Fouquet, Hao Li:
  Hamiltonicity of Bipartite Biclaw-free Graphs. 95-102
  
• Jochen Harant, Hansjoachim Walther:
  A Lower Bound for the Shortness Coefficient of a Class of Graphs. 103-105
  
• Xueliang Li, Fuji Zhang:
  Hamiltonicity of a Type of Interchange Graphs. 107-111
  
• Jaroslav Nesetril:
  on ordered Graphs and Graph orderings. 113-116
  
• Thomas Niessen:
  How to Find overfull Subgraphs in Graphs with Large Maximum Degree. 117-125
  
• Frank Pfeiffer:
  A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs. 127-135
  
• Werner Poguntke:
  on Reliable Graphs with Static Routing Plans. 137-146
  
• Erich Prisner:
  Algorithms for Interval Catch Digraphs. 147-157
  
• Alain Quilliot, Sun Xiao Chao:
  Algorithmic Characterizations of Interval ordered Hypergraphs and Applications. 159-170
  
• Horst Sachs, Holger Zernitz:
  Remark on the Dimer Problem. 171-179
  
• Günter Schaar:
  Remarks on Hamiltonian Properties of Powers of Digraphs. 181-186
  
• Zsolt Tuza:
  Inequalities for Minimal Covering Sets in Set Systems of Given Rank. 187-195
  
• Margit Voigt, Hansjoachim Walther:
  Chromatic Number of Prime Distance Graphs. 197-209
  
• Lutz Volkmann:
  on Graphs with Equal Domination and Covering Numbers. 211-217
  
• Angela von Arnim, Colin de la Higuera:
  Computing the Jump Number on Semi-orders Is Polynomial. 219-232
  
• Mariusz Wozniak:
  Embedding Graphs of Small Size. 233-241
  

Volume 51, Number 3, 1994

• Claude-Nicolas Fiechter:
  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems. 243-267
  
• Giulia Galbiati, Francesco Maffioli:
  on the Computation of Pfaffians. 269-275
  
• Michel X. Goemans:
  Arborescence Polytopes for Series-parallel Graphs. 277-289
  
• Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
  Periodic Assignment and Graph Colouring. 291-305
  
• Joseph Y.-T. Leung, Vincent K. M. Yu, W.-D. Wei:
  Minimizing the Weighted Number of Tardy Task Units. 307-316
  
• William R. Schmitt, Michael S. Waterman:
  Linear Trees and RNA Secondary Structure. 317-323
  
• Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
  Separation of Convex Sets. 325-328