Clique-perfectness and balancedness of some graph classes

A graph is clique-perfect if the maximum size of a clique-independent set (a set of pairwise disjoint maximal cliques) and the minimum size of a clique-transversal set (a set of vertices meeting every maximal clique) coincide for each induced subgraph. A graph is balanced if its clique-matrix contai...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Durán, Guillermo A., Safe, Martín Darío
Publicado: 2014
Materias:
balanced graphs
clique-perfect graphs
diamond-free graphs
P4-tidy graphs
paw-free graphs
recognition algorithms
Clustering algorithms
Diamonds
Graphic methods
Polynomial approximation
Balanced graphs
Diamond-free graphs
Free graphs
Perfect graph
Recognition algorithm
Graph theory
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00207160_v91_n10_p2118_Bonomo
http://hdl.handle.net/20.500.12110/paper_00207160_v91_n10_p2118_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares