A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a hole with an even number of vertices. We prove that a (pan, even hole)-free graph can be decomposed by clique cutsets into essentially unit circular-arc graphs. This structure theorem is the basis of our O(nm)-time certifying algorithm for recognizing (pan, even hole)-free graphs and for our O(n^2.5+nm)-time algorithmarXiv:1508.03062v2 fatcat:futyzwrk6zhp3gxxtreiof2cti