On clique-perfect and K-perfect graphs

A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph H of G. When equality holds for every clique subgraph of G, the graph is c

• Type: Journal
• Year: 2006
• Where: ARSCOM
• Authors: Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter
• Keywords: ARSCOM 2006, Cardinality, Clique Subgraphs, Maximum Cliqueindependent