Benjamin Momège. Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path. In Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, editors, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings. Volume 10139 of Lecture Notes in Computer Science, pages 205-216, Springer, 2017. [doi]
@inproceedings{Momege17,
title = {Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path},
author = {Benjamin Momège},
year = {2017},
doi = {10.1007/978-3-319-51963-0_16},
url = {http://dx.doi.org/10.1007/978-3-319-51963-0_16},
researchr = {https://researchr.org/publication/Momege17},
cites = {0},
citedby = {0},
pages = {205-216},
booktitle = {SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings},
editor = {Bernhard Steffen and Christel Baier and Mark van den Brand and Johann Eder and Mike Hinchey and Tiziana Margaria},
volume = {10139},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-51962-3},
}