Abstract
(4K1,C4,C6)-free graphs are precisely the even-hole-free graphs of stability number at most three. We show that (4K1,C4,C6)-free graphs can be recognized in O(n3) time, and furthermore, that all the following can be computed in O(n3) time for such graphs: an optimal coloring, a minimum clique cover, and the list of all maximal cliques. We also show that every (4K1,C4,C6)-free graph on n vertices has at most n maximal cliques.
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.
