Abstract
AbstractA hole is a chordless cycle with at least four vertices. A pan is a graph that 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 ‐time certifying algorithm for recognizing (pan, even hole)‐free graphs and for our ‐time algorithm to optimally color them. Using this structure theorem, we show that the tree‐width of a (pan, even hole)‐free graph is at most 1.5 times the clique number minus 1, and thus the chromatic number is at most 1.5 time the clique number.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
