Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho. Hamiltonian Cycles in Covering Graphs of Trees. In Xiaofeng Gao, Hongwei Du, Meng Han, editors, Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II. Volume 10628 of Lecture Notes in Computer Science, pages 261-275, Springer, 2017. [doi]
@inproceedings{HellNS17,
title = {Hamiltonian Cycles in Covering Graphs of Trees},
author = {Pavol Hell and Hiroshi Nishiyama and Ladislav Stacho},
year = {2017},
doi = {10.1007/978-3-319-71147-8_18},
url = {https://doi.org/10.1007/978-3-319-71147-8_18},
researchr = {https://researchr.org/publication/HellNS17},
cites = {0},
citedby = {0},
pages = {261-275},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II},
editor = {Xiaofeng Gao and Hongwei Du and Meng Han},
volume = {10628},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-71147-8},
}