1. Fixed-parameter tractability of (n−k) list coloring;Paliwal,2019
2. Set partitioning via inclusion-exclusion;Björklund;SIAM J. Comput.,2009
3. Parameterized complexity of vertex colouring;Cai;Discrete Appl. Math.,2003
4. Linear kernels in linear time, or how to save k colors in o(n2) steps;Chor,2004
5. Coloring graphs with forbidden induced subgraphs;Chudnovsky,2014