APA (7th ed.) Citation

Ahn, J., Im, S., & Oum, S. (2022). The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.

Chicago Style (17th ed.) Citation

Ahn, Jungho, Seonghyuk Im, and Sang-il Oum. The Proper Conflict-free $k$-coloring Problem and the Odd $k$-coloring Problem Are NP-complete on Bipartite Graphs. 2022.

MLA (9th ed.) Citation

Ahn, Jungho, et al. The Proper Conflict-free $k$-coloring Problem and the Odd $k$-coloring Problem Are NP-complete on Bipartite Graphs. 2022.