Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

We study the Max Partial $k$-Coloring problem, where we are given a vertex-weighted graph, and we ask for a maximum-weight induced subgraph that admits a proper $k$-coloring. For $…