Maximum k-colourable induced subgraphs in (P5+rK1)-free graphs
Abstract
We show that for any nonnegative integer r, the Weighted Maximum List-k-Colourable Induced Subgraph problem can be solved in polynomial time for input graphs that do not contain (P5+ rK1) as an induced subgraph, and give an explicit algorithm demonstrating this. This answers a question of Agrawal et al.\ (2024).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.