Lee, P., Liu, T., & Tsai, M. (2026). Determining the Outerthickness of Graphs Is NP-Hard.
Cita Chicago (17th ed.)Lee, Pin-Hsian, Te-Cheng Liu, i Meng-Tsung Tsai. Determining the Outerthickness of Graphs Is NP-Hard. 2026.
Cita MLA (9th ed.)Lee, Pin-Hsian, et al. Determining the Outerthickness of Graphs Is NP-Hard. 2026.
Atenció: Aquestes cites poden no estar 100% correctes.