Electronic Notes in Discrete Mathematics, Volume 3

Volume 3, May 1999

• Claudio Arbib:
  A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs. 2-6
  
• Van Bang Le:
  Bipartite-Perfect Graphs. 7-12
  
• Ulrich Blasum, Winfried Hochstättler, Peter Oertel:
  STEINER-Diagrams. 13-18
  
• Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier:
  SIMPLE MAX-CUT for unit interval graphs and graphs with few P₄s. 19-26
  
• S. Brandt:
  Triangle-free graphs without forbidden subgraphs. 27
  
• Gunnar Brinkmann, Brendan D. McKay:
  Fast generation of some classes of planar graphs. 28-31
  
• Gunnar Brinkmann, U. von Nathusius, A. H. R. Palser:
  Fast generation of nanotube caps. 32
  
• Janka Chlebíková:
  The structure of obstructions to treewidth and pathwidth. 33-38
  
• Victor Chepoi, Feodor F. Dragan:
  A note on distance approximating trees in graphs. 39
  
• Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
  On bounds for the rotation distance between binary coupling trees. 40-44
  
• Corinne Feremans, Martine Labbé, Gilbert Laporte:
  The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. 45-50
  
• Miranca Fischermann, Lutz Volkmann:
  Graphs having distance-n domination number half their order. 51-54
  
• Juliane Greinus, Gunnar Brinkmann:
  Patches with minimal boundary length. 55-59
  
• Harald Gropp:
  On triple systems, in particular those with 13 elements. 60-64
  
• Yubao Guo, Jin Ho Kwak:
  The cycle structure of regular multipartite tournaments. 65-68
  
• Thomas Harmuth:
  The enumeration of cubic maps with given genus and given face degrees. 69-71
  
• Mark E. Hartmann, Özgür Özlük:
  Solving the Traveling Circus Problem by Branch & Cut. 72-76
  
• M. Hayer, Winfried Hochstättler:
  Test Sets for Vertex Cover Problems. 77-81
  
• Arne Hoffmann, Bert Randerath, Lutz Volkmann:
  Maximal Sets of 2-Factors in Complete Equipartite Graphs. 82-85
  
• Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
  Chromatic spectrum is broken. 86-89
  
• Sandi Klavzar, Uros Milutinovic, Ciril Petr:
  On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract). 90-93
  
• Ton Kloks, Dieter Kratsch, Haiko Müller:
  On the structure of graphs with bounded asteroidal number. 94
  
• Ekkehard Köhler, Matthias Kriesell:
  Edge-Dominating Trails in AT-free Graphs (Extended Abstract). 95-101
  
• Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
  Solving Frequency Assignment Problems via Tree-Decomposition¹. 102-105
  
• Dieter Kratsch, Lorna Stewart:
  Approximating Bandwidth by Mixing Layouts of Interval Graphs. 106-109
  
• Matthias Kriesell:
  Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. 110-113
  
• Jamel Lakhal, Luc Litzler:
  An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs. 114-117
  
• Martin Lugering:
  Provably Good Global Routing of Integrated Circuits. 118-127
  
• Lilian Markenzon, N. Paciornik:
  Equilateral Drawing of 2-Connected Planar Chordal Graphs. 128-132
  
• Aziz Moukrim:
  Non-preemptive Profile Scheduling and Quasi Interval Orders. 133-139
  
• H. M. Mulder:
  Intersection graphs on trees with a tolerance. 140
  
• M. Nakamura:
  Lifting and reduction of antimatroids. 141
  
• Thomas Niessen, Jaakob Kind:
  Polyhedral Sets and Integer Rounding. 142-145
  
• Stavros D. Nikolopoulos:
  Coloring permutation graphs in parallel. 146-152
  
• Patric R. J. Östergård:
  A New Algorithm for the Maximum-Weight Clique Problem. 153-156
  
• Dmitrii V. Pasechnik:
  Bipartite sandwiches: semide?nite relaxations for maximum biclique. 157-161
  
• Artem V. Pyatkin:
  The incidentor coloring of multigraphs and its application in data networks. 162-165
  
• Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes:
  Vertex Pancyclic Graphs. 166-170
  
• R. M. N. D. Rodrigues, N. M. M. Abreu, Lilian Markenzon:
  Maxregularity and Maximal Outerplanar Graphs. 171-175
  
• Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree:
  3-colored Ramsey Numbers of Odd Cycles. 176-178
  
• Anand Srivastav, Hartmut Schroeter, Christoph Michel:
  Alternating TSP and Printed Circuit Board Assembly. 179-183
  
• Yannis C. Stamatiou, Dimitrios M. Thilikos:
  Monotonicity and inert fugitive search games. 184
  
• Meike Tewes:
  Pancyclic orderings of in-tournaments. 185-188
  
• Dimitrios M. Thilikos:
  Quickly Excluding K_{2, r} from Planar Graphs. 189-194
  
• Robert Tijdeman:
  Discrete tomography in four directions. 195-198
  
• Jean-Marie Vanherpe:
  On canonical decomposition of bipartite graphs. 199-204
  
• Hansjoachim Walther:
  Polyhedral Graphs with Extreme Numbers of Types of Faces. 205-207
  
• Ligong Wang, Xueliang Li, Ruying Liu:
  Integral Trees With Diameter 6 or 8. 208-213
  
• A. Pawel Wojda:
  Erdös-type condition for a graph to contain k independent edges. 214-216
  
• Blaz Zmazek, Janez Zerovnik:
  Algorithm for Recognizing Cartesian Graph Bundles. 217-221
  
• B. Reed:
  Introducing Directed Tree Width. 222-229
  
• Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
  Linear-time Algorithms for Maximum Sets of Sources and sinks. 230-234