Abstract
An even pair in a graph is a pair of vertices such that every chordless path between them has even length. A graph is called perfectly contractile when every induced subgraph can be transformed into a clique through a sequence of even-pair contractions. In this paper we characterize the planar graphs that are perfectly contractile by determining all the minimal forbidden subgraphs. We give a polynomial algorithm for the recognition of perfectly contractile planar graphs.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
