Complexity of near-3-choosability problem

DOI10.1007/s00373-024-02837-xMaRDI QIDQ6632143

Sagar S. Sawant, S. Rohini, Sounaka Mishra

Publication date: 4 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmgraph coloringlist coloring\(\mathbb{NP}\)-completeness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Complexity of near-3-choosability problem