Graph classes with and without powers of bounded clique-width

We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers k and ℓ such that the kth powers of the graphs are of clique-width at most ℓ. We give sufficient and necessary conditions for this property. As our main results, we characteriz...

Descripción completa

Detalles Bibliográficos
Autores principales: Bonomo, F., Grippo, L.N., Milanič, M., Safe, M.D.
Formato: JOUR
Materias:
Clique-width
Hereditary graph class
Power of a graph
Power-bounded clique-width
Combinatorial mathematics
Forbidden induced subgraphs
Graph class
Induced subgraphs
Positive integers
Sufficient and necessary condition
Within class
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v199_n_p3_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares