Abstract
A set S of pairwise nonadjacent vertices in an undirected graph G is called a stable transversal of G if S meets every maximal (with respect to set-inclusion) clique of G . G is called strongly perfect if all its induced subgraphs (including G itself) have stable transversals. A claw is a graph consisting of vertices a , b , c , d and edges ab , ac , ad . We characterize claw-free strongly perfect graphs by five infinite families of forbidden induced subgraphs. This result—whose validity had been conjectured by Ravindra [Research problems, Discrete Math. 80 (1990) 105–107]—subsumes the characterization of strongly perfect line-graphs that was discovered earlier by Ravindra [Strongly perfect line graphs and total graphs, Finite and Infinite Sets. Colloq. Math. Soc. János Bolyai 37 (1981) 621–633].
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.
