Title of article :
A new characterization of trivially perfect graphs
Author/Authors :
Rubio-Montiel, Christian Universidad Nacional Autonoma de Mexico, Ciudad Universitaria - Instituto de Matematicas, Mexico
Abstract :
A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) α(G) equals the number of (maximal) cliquesm(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend somedefinitions to infinite graphs.
Keywords :
Perfect graphs , complete coloring , Grundy number , forbidden graph characterization
Journal title :
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title :
Electronic Journal of Graph Theory and Applications (EJGTA)
