Coloring Powers of Graphs of Bounded Clique-Width

We show that the p-coloring problem is polynomial for classes of graphs of bounded clique-width.

Data and Resources

Additional Info

Field Value
Source 29th International Workshop on Graph-Theoretic Concepts in Computer Science
Author Todinca, Ioan
Maintainer CCSD
Last Updated May 9, 2026, 23:26 (UTC)
Created May 9, 2026, 23:26 (UTC)
Identifier hal-00085558
Language en
contributor Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) ; Université d'Orléans (UO)-Ecole Nationale Supérieure d'Ingénieurs de Bourges
creator Todinca, Ioan
date 2003-05-09T00:00:00
harvest_object_id 7f642122-5204-4bcd-8cf7-a7c680f1d848
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-08-12T00:00:00
set_spec type:COMM