Structural parameterizations for equitable coloring

DOI10.1007/978-3-030-61792-9_11MaRDI QIDQ2081609zbMATH OpenOpenAlexFDO

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

Publication date 13 October 2022

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

zbMATH Keywords

distance to clusterdistance to co-clusterdistance to disjoint pathsequitable coloringparameterized complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• scientific article; zbMATH DE number 7058467
• What makes equitable connected partition easy
• Complexity of tree-coloring interval graphs equitably
• Mathematical Foundations of Computer Science 2004
• Equitable colorings of bounded treewidth graphs

Cited in

(9)

• A flow based pruning scheme for enumerative equitable coloring algorithms
• A polyhedral approach for the equitable coloring problem
• Iterated Type Partitions
• A fast algorithm for equitable coloring
• scientific article; zbMATH DE number 7058467 (Why is no real title available?)
• Structural parameterizations of budgeted graph coloring
• Structural parameterizations of budgeted graph coloring
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
• Equitable colorings of \(l\)-corona products of cubic graphs

This page was built for publication: Structural parameterizations for equitable coloring

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