Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs

A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a minimum clique-transversal and a maximum cliqu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Durán, Guillermo A.
Publicado: 2008
Materias:
Claw-free graphs
Clique-perfect graphs
Hereditary clique-Helly graphs
Line graphs
Perfect graphs
Image processing
Mathematical models
Number theory
Problem solving
Set theory
Claw free graphs
Clique perfect graphs
Graph theory
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v156_n7_p1058_Bonomo
http://hdl.handle.net/20.500.12110/paper_0166218X_v156_n7_p1058_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares