Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
From MaRDI portal
Publication:6513060
arXiv2309.09228MaRDI QIDQ6513060FDOQ6513060
Jan Kratochvíl, Nikola Jedličková
This page was built for publication: Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6513060)
