Structural parameterizations for equitable coloring
From MaRDI portal
Publication:2081609
DOI10.1007/978-3-030-61792-9_11OpenAlexW3116419275MaRDI QIDQ2081609
Vinícius Fernandes dos Santos, Matheus R. Guedes, Guilherme C. M. Gomes
Publication date: 13 October 2022
Full work available at URL: https://arxiv.org/abs/1911.03297
parameterized complexityequitable coloringdistance to clusterdistance to co-clusterdistance to disjoint paths
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (2)
Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ Structural parameterizations of budgeted graph coloring
This page was built for publication: Structural parameterizations for equitable coloring
