Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization

DOI10.1007/s00453-022-01085-wMaRDI QIDQ6107887

Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Matheus R. Guedes

Publication date: 28 June 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parameterized complexitypolynomial kernelFPT algorithmequitable coloringcross-composition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data reduction for graph coloring problems
• A fast algorithm for equitable coloring
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• On the complexity of some colorful problems parameterized by treewidth
• Restrictions of graph partition problems. I
• Equitable colorings of bounded treewidth graphs
• Mutual exclusion scheduling
• Parameterized complexity of vertex colouring
• Structural parameterizations for equitable coloring
• Integer Programming with a Fixed Number of Variables
• What Makes Equitable Connected Partition Easy
• Equitable Coloring
• A Fast Branching Algorithm for Cluster Vertex Deletion
• Iterated Type Partitions
• Paths, Trees, and Flowers
• Parameterized Algorithms
• Bounded vertex coloring of trees

This page was built for publication: Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization