Fixed-Parameter Tractability of (n - k) List Coloring
Authors:
- 1 October 2020
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 64 (7) , 1307-1316
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Open Problems on Graph Coloring for Special Graph Classes2016
- Parameterized Algorithms2015
- Data reduction for graph coloring problemsInformation and Computation, 2013
- On the complexity of some colorful problems parameterized by treewidthInformation and Computation, 2011
- Set Partitioning via Inclusion-ExclusionSIAM Journal on Computing, 2009
- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps2004
- Parameterized complexity of vertex colouringDiscrete Applied Mathematics, 2003
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-completeDiscrete Mathematics, 1980
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973