Parameterized complexity of list coloring and max coloring
type: Item
instance of: scholarly article
title: Parameterized complexity of list coloring and max coloring
DOI: 10.1007/978-3-031-09574-0_4
author: Bardiya Aryanfard
author: Fahad Panolan
publication date: 2022-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7615730
zbMATH Keywords: graph coloring
zbMATH Keywords: fixed parameter tractability
zbMATH Keywords: randomized algorithms
zbMATH Keywords: reduction
zbMATH Keywords: exponential time hypothesis
MaRDI profile type: Publication
full work available at URL: 978-3-031-09574-0 4
OpenAlex ID: W4285307874
cites work: Ruling out FPT algorithms for weighted coloring on forests
cites work: Weighted Coloring in Trees
cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
cites work: Q4414490
cites work: A probabilistic remark on algebraic program testing
cites work: Saving colors and max coloring: some fixed-parameter tractability results
cites work: Weighted coloring: further complexity and approximability results
cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover
cites work: Rural postman parameterized by the number of components of required edges
cites work: Parameterized Pre-Coloring Extension and List Coloring Problems
cites work: On the complexity of \(k\)-SAT
cites work: Q3002818
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
cites work: Q3851616
description: scientific article; zbMATH DE number 7615730