Jaworska, J., Kielak, B., Masařík, T., & Masaříková, J. (2025). Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs.
Citazione stile Chigago Style (17a edizione)Jaworska, Justyna, Bartłomiej Kielak, Tomáš Masařík, e Jana Masaříková. Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs. 2025.
Citatione MLA (9a ed.)Jaworska, Justyna, et al. Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs. 2025.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.