Volume 3, May 1999
6th Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, the Netherlands, 26-28 May 1999, Edited by H.J. Broersma, U. Faigle, C. Hoede and J.L. Hurink
Claudio Arbib:
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.
2-6
S. Brandt:
Triangle-free graphs without forbidden subgraphs.
27
Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth.
33-38
Harald Gropp:
On triple systems, in particular those with 13 elements.
60-64
Thomas Harmuth:
The enumeration of cubic maps with given genus and given face degrees.
69-71
Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
110-113
Martin Lügering:
Provably Good Global Routing of Integrated Circuits.
118-127
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
Artem V. Pyatkin:
The incidentor coloring of multigraphs and its application in data networks.
162-165
Meike Tewes:
Pancyclic orderings of in-tournaments.
185-188
A. Pawel Wojda:
Erdös-type condition for a graph to contain k independent edges.
214-216
data released under the ODC-BY 1.0 license
