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...
Autores principales: | Bonomo, F., Grippo, L.N., Milanič, M., Safe, M.D. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0166218X_v199_n_p3_Bonomo |
Aporte de: |
Ejemplares similares
-
Graph classes with and without powers of bounded clique-width
por: Bonomo, Flavia, et al.
Publicado: (2016) -
Graph classes with and without powers of bounded clique-width
por: Bonomo, Flavia, et al.
Publicado: (2024) -
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
por: Bonomo, Flavia, et al.
Publicado: (2009) -
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
por: Bonomo, F., et al. -
On probe 2-clique graphs and probe diamond-free graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)