Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc 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. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every i...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Chudnovsky, M., Durán, G.
Formato: JOUR
Materias:
Clique-perfect graphs
Diamond-free graphs
Helly circular-arc graphs
K-perfect graphs
Perfect graphs
Claw-free graphs
Forbidden induced subgraphs
Graph g
Independent sets
Induced subgraph
Maximum cliques
New class
Partial characterizations
Polynomial-time
Recognition algorithms
Cavity resonators
Characterization
Diamonds
Polynomial approximation
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0012365X_v309_n11_p3485_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares