Structural parameterizations of budgeted graph coloring

DOI10.1007/978-3-030-96731-4_28OpenAlexW3210799324MaRDI QIDQ5918737

Aritra Banik, Venkatesh Raman, Suman Banerjee, Susobhan Bandopadhyay

Publication date: 13 July 2022

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringparameterized complexityexact exponential algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Structural parameterizations of budgeted graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• A fast branching algorithm for cluster vertex deletion
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• Exact exponential algorithms.
• On the complexity of some colorful problems parameterized by treewidth
• Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
• Equitable coloring of trees
• Mutual exclusion scheduling
• Between Treewidth and Clique-Width
• Kernelization Lower Bounds by Cross-Composition
• Parameterized Algorithms

This page was built for publication: Structural parameterizations of budgeted graph coloring