Abstract
Let S be an arbitrary collection of stars in a graph G such that there is no chain of length <3 joining the centers of (any) two stars in G . We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S . These graphs will be called skeletal graphs and we prove that they are strict quasi-parity graphs and hence perfect graphs.
Sign-in/Register to access full text options 
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.
