Structural parameterizations of budgeted graph coloring

We introduce a variant of the graph coloring problem, which we denote as Budgeted Coloring Problem (BCP). Given a graph G, an integer c and an ordered list of integers (b1,b2,…,bc), BCP asks whether there exists a proper coloring of G where the i-th color is used to color at most bi many vertices. T...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 940; pp. 209 - 221
Main Authors:	Bandopadhyay, Susobhan, Banerjee, Suman, Banik, Aritra, Raman, Venkatesh
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.01.2023
Subjects:	Exact exponential algorithm Graph coloring Parameterized complexity Exact exponential algorithm Parameterized complexity Graph coloring
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!