Clique-perfectness of complements of line graphs

The clique-transversal number τc(G) of a graph G is the minimum size of a set of vertices meeting all the cliques. The clique-independence number αc(G) of G is the maximum size of a collection of vertex-disjoint cliques. A graph is clique-perfect if these two numbers are equal for every induced subg...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Durán, Guillermo A., Safe, Martín Darío
Publicado: 2011
Materias:
Clique-perfect graphs
Edge-coloring
Line graphs
Maximal matchings
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v37_nC_p327_Bonomo
http://hdl.handle.net/20.500.12110/paper_15710653_v37_nC_p327_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares