Parameterized complexity of list coloring and max coloring
From MaRDI portal
Publication:2097212
Cites work
- A probabilistic remark on algebraic program testing
- Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
- Can you beat treewidth?
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1953087 (Why is no real title available?)
- On the complexity of k-SAT
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Parameterized pre-coloring extension and list coloring problems
- Rural postman parameterized by the number of components of required edges
- Saving colors and max coloring: some fixed-parameter tractability results
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Weighted coloring in trees
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Weighted coloring: further complexity and approximability results
Cited in
(5)- Algorithmic complexity of list colorings
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Near-optimal list colorings
- Exploring the complexity boundary between coloring and list-coloring
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration
This page was built for publication: Parameterized complexity of list coloring and max coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097212)
