Complexity of Near-3-Choosability Problem.

MLA

Mishra, Sounaka, et al. “Complexity of Near-3-Choosability Problem.” Graphs & Combinatorics, vol. 40, no. 6, Dec. 2024, pp. 1–19. EBSCOhost, https://doi.org/10.1007/s00373-024-02837-x.

APA

Mishra, S., Rohini, S., & Sawant, S. S. (2024). Complexity of Near-3-Choosability Problem. Graphs & Combinatorics, 40(6), 1–19. https://doi.org/10.1007/s00373-024-02837-x

Chicago

Mishra, Sounaka, S. Rohini, and Sagar S. Sawant. 2024. “Complexity of Near-3-Choosability Problem.” Graphs & Combinatorics 40 (6): 1–19. doi:10.1007/s00373-024-02837-x.