On structural parameterizations of the selective coloring problem

DOI10.1016/J.PROCS.2021.11.013MaRDI QIDQ6890916zbMATH OpenFDO

Authors Guilherme C. M. Gomes, Vinícius F. dos Santos

Publication date 2 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2021.11.013

zbMATH Keywords

cross-compositiondistance to clusterkernelizationmulticolored independent setparameterized complexityselective coloringvertex cover

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(1)

• Multicut problems in embedded graphs: the dependency of complexity on the demand pattern

This page was built for publication: On structural parameterizations of the selective coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890916)