Shao, S., & Wu, Y. (2025). Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian.
Chicago Style (17th ed.) CitationShao, Sihong, and Yuxuan Wu. Every 2-connected, Cubic, Planar Graph with Faces of Size at Most 6 Is Hamiltonian. 2025.
MLA (9th ed.) CitationShao, Sihong, and Yuxuan Wu. Every 2-connected, Cubic, Planar Graph with Faces of Size at Most 6 Is Hamiltonian. 2025.
Warning: These citations may not always be 100% accurate.