2026-07-22T13:27:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12715 2024-03-06T10:50:39Z ddc:004 open_access

Structural Parameterizations of Clique Coloring Jaffke, Lars Lima, Paloma T. Philip, Geevarghese clique coloring treewidth clique-width structural parameterization Strong Exponential Time Hypothesis A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether a given graph has a clique coloring with q colors. For fixed q ≥ 2, we give an 𝒪^⋆(q^{tw})-time algorithm when the input graph is given together with one of its tree decompositions of width tw. We complement this result with a matching lower bound under the Strong Exponential Time Hypothesis. We furthermore show that (when the number of colors is unbounded) Clique Coloring is XP parameterized by clique-width. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lars Jaffke and Paloma T. Lima and Geevarghese Philip 2020 Is Part Of LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2020.49 urn:nbn:de:0030-drops-127157 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.49 eng https://creativecommons.org/licenses/by/3.0/legalcode