Abstract
Trivially perfect graphs are graphs for which the stability number equals the number of (maximal) cliques, for every induced subgraph. Trivially perfect graphs are equivalent to the {C_4, P_4}-free graphs, and to the comparability graphs orders whose Hasse diagram is a rooted tree. We survey classical and recent results on this fascinating and highly non-trivial graph family.
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.
