Angeliya, C. U., Karthick, T., & Huang, S. (2025). ($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable.
Chicago Style (17th ed.) CitationAngeliya, C. U., T. Karthick, and Shenwei Huang. ($P_2+P_4$, $K_4-e$)-free Graphs Are Nearly $ω$-colorable. 2025.
MLA (9th ed.) CitationAngeliya, C. U., et al. ($P_2+P_4$, $K_4-e$)-free Graphs Are Nearly $ω$-colorable. 2025.
Warning: These citations may not always be 100% accurate.