Some (in)tractable parameterizations of coloring and list-coloring

DOI10.1007/978-3-319-78455-7_10zbMath1446.68074OpenAlexW2794218106MaRDI QIDQ777282

Venkatesh Raman, Pranav Arora, Aritra Banik, Vijay Kumar Paliwal

Publication date: 7 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_10

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Fixed-parameter tractability of \((n-k)\) list coloring ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems

This page was built for publication: Some (in)tractable parameterizations of coloring and list-coloring