Clique-perfectness of complements of line graphs

Mostrar todas las versiones(2)

A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and sufficient conditions for the complement of a line graph to be clique-perfect and...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Safe, M.D., Wagler, A.K.
Formato: JOUR
Materias:
Clique-perfect graphs
Edge-coloring
Line graphs
Matchings
Graphic methods
All maximal cliques
Circular structures
Edge coloring
Induced subgraphs
Line graph
Perfect graph
Recognition algorithm
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v186_n1_p19_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares