Practical toroidality testing
Date
1993
Authors
Neufeld, Eugene Trivan
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A torus is a sphere with one handle. A toroidal graph is one that can be embedded in the torus with no overlapping edges. Although various theoretically efficient algorithms for testing toroidality of graphs have been published, none is claimed to be "practical". We develop an exponential toroidality tester that is practical enough to compute the minor order obstructions to toroidality on up to ten vertices and which gives indications that there are several thousand of these obstructions all together. We validate the algorithm combinatorially, and discuss prospects of improvements in efficiency.
Description
Keywords
UN SDG 7: Affordable and Clean Energy