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
: A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.
: Triangle-free graphs without forbidden subgraphs.
: The structure of obstructions to treewidth and pathwidth.
: On triple systems, in particular those with 13 elements.
: The enumeration of cubic maps with given genus and given face degrees.
: Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
: Provably Good Global Routing of Integrated Circuits.
: Non-preemptive Profile Scheduling and Quasi Interval Orders.
H. M. Mulder
: Intersection graphs on trees with a tolerance.
: Lifting and reduction of antimatroids.
Artem V. Pyatkin
: The incidentor coloring of multigraphs and its application in data networks.
: Pancyclic orderings of in-tournaments.
A. Pawel Wojda
: Erdös-type condition for a graph to contain k independent edges.