Complexity of Near-3-Choosability problemsPublished in Graphs and Combinatorics, 2024Recommended citation: Sounaka Mishra, Rohini S. and Sagar S. Sawant (2024). " Complexity of Near-3-Choosability problems." To appear in Graphs and Combinatorics.Share on Twitter Facebook LinkedIn Previous Next