On clique-perfect and K-perfect graphs

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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Groshaus, M., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Clique graphs
Clique-Helly graphs
Clique-perfect graphs
Good graphs
K-perfect graphs
Perfect graphs
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03817032_v80_n_p97_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares