Author:
Baniasadi Pouya,Ejov Vladimir,Filar Jerzy A.,Haythorpe Michael
Publisher
Springer International Publishing
Reference16 articles.
1. Baniasadi, P., Ejov, V., Filar, J.A., Haythorpe, M., Rossomakhine, S.: Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian Cycle Problem. Mathematical Programming Computation 6(1): 55–75, (2014)
2. Barnette, D.: In: Tutte, W.T. (ed.) Recent Progress in Combinatorics: Proceedings of the Third Waterloo Conference on Combinatorics, May 1968. Conjecture 5 Academic, New York (1969)
3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, pp. 61 and 242. North Holland, New York (1976)
4. Eppstein, D.: The traveling salesman problem for cubic graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2748, pp. 307–318. Springer, Berlin/Heidelberg (2003)
5. Faulkner, G.B., Younger, D.H.: Non-Hamiltonian cubic planar maps. Discret. Math. 7, 67–74 (1974)