Maximum list $r$-colorable induced subgraphs in $k{P}_3$-free graphs

Esther Galby, Paloma T. Lima, Andrea Munaro +1

We show that, for every fixed positive integers $r$ and $k$, \textsc{Max-Weight List $r$-Colorable Induced Subgraph} admits a polynomial-time algorithm on $k{P}_3$-free graphs. This…