Abstract
A graph $G$ is \emph { trivially perfect } if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices ( the stability number ) $\alpha(G)$ equals the number of ( maximal ) cliques $m(G)$ . We characterize the trivially perfect graphs in terms of vertex- coloring and we extend some definitions to infinite 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 callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: 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.
