Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs

Mostrar todas las versiones(2)

A graph is clique-perfect if the cardinality of a maximum clique-independent set equals the cardinality of a minimum clique-transversal, for all its induced subgraphs. A graph G is coordinated if the chromatic number of the clique graph of H equals the maximum number of cliques of H with a common ve...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Durán, Guillermo A., Soulignac, Francisco Juan
Publicado: 2008
Materias:
Clique-perfect graphs
coordinated graphs
paw-free graphs
perfect graphs
triangle-free graphs
{gem,W4,bull}-free graphs
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v30_nC_p51_Bonomo
http://hdl.handle.net/20.500.12110/paper_15710653_v30_nC_p51_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares