Jedličková, N., & Kratochvíl, J. (2023). Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number.
Chicago Style (17th ed.) CitationJedličková, Nikola, and Jan Kratochvíl. Hamiltonian Path and Hamiltonian Cycle Are Solvable in Polynomial Time in Graphs of Bounded Independence Number. 2023.
MLA (9th ed.) CitationJedličková, Nikola, and Jan Kratochvíl. Hamiltonian Path and Hamiltonian Cycle Are Solvable in Polynomial Time in Graphs of Bounded Independence Number. 2023.
Warning: These citations may not always be 100% accurate.