Parameterized Saga of First-Fit and Last-Fit Coloring

Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan +2

The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph $G$ in a given order and assigns the first available color to each vertex $v$ in $G$. In…