|
Organizers |
Crossing-free matchings in regular outerplane drawings
by
Paul C. Kainen
Department of Mathematics, Georgetown University
When does a regular graph have a circular layout with pages which are perfect matchings? It is shown that this holds for bipartite complete and hypercube graphs, as well as certain classes of 3-regular and 4-regular circulants. By a result from Overbay's thesis, any such graph must be bipartite, and a conjecture of Bernhart and the author holds that each bipartite graph does have such a "dispersible" embedding. Relations among book thickness type invariants will be considered.
Date received: November 30, 2009
Copyright © 2009 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cazp-17.