Ken-ichi Kawarabayashi, Kenta Ozeki. 4-connected projective-planar graphs are hamiltonian-connected. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 378-395, SIAM, 2013. [doi]
Abstract is missing.