Parameterized complexity of conflict-free graph coloring

DOI10.1007/978-3-030-24766-9_13OpenAlexW2965723709MaRDI QIDQ2285090

Sudeshna Kolay, Astrid Pieterse, Hans L. Bodlaender

Publication date: 16 January 2020

Full work available at URL: https://arxiv.org/abs/1905.00305

zbMATH Keywords

fixed-parameter tractabilitykernelizationconflict-free coloringcombinatorial bounds

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (4)

Conflict-free coloring bounds on open neighborhoods ⋮ Structural parameterization for minimum conflict-free colouring ⋮ A tight bound for conflict-free coloring in terms of distance to cluster ⋮ Conflict-free coloring: graphs of bounded clique width and intersection graphs

This page was built for publication: Parameterized complexity of conflict-free graph coloring