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

Mostrar todas las versiones(4)

A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H of G. A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Soulignac, F., Sueiro, G.
Formato: JOUR
Materias:
Clique-perfect graphs
Coordinated graphs
Paw-free graphs
Perfect graphs
Triangle-free graphs
{gem, W4, bull}-free graphs
{gem, W<sub>4</sub>, bull}-free graphs
Gems
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v157_n17_p3511_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares