Petr Gregor, Arturo Merino, Torsten Mütze, Francesco Verciani. Graphs that admit a Hamilton path are cup-stackable. // Discrete Mathematics. – 2025. – DOI: 10.1016/j.disc.2024.114375. – URL: https://doi.org/10.1016/j.disc.2024.114375
Petr Gregor, Arturo Merino, Torsten Mütze, & Francesco Verciani (2025). Graphs that admit a Hamilton path are cup-stackable. Discrete Mathematics. https://doi.org/10.1016/j.disc.2024.114375
Petr Gregor, et al. “Graphs that admit a Hamilton path are cup-stackable.” Discrete Mathematics, 2025. doi:10.1016/j.disc.2024.114375.
@article{Gregor2025,
title = {Graphs that admit a Hamilton path are cup-stackable},
author = {Gregor, Petr and Merino, Arturo and Mütze, Torsten and Verciani, Francesco},
journal = {Discrete Mathematics},
year = {2025},
doi = {10.1016/j.disc.2024.114375},
url = {https://doi.org/10.1016/j.disc.2024.114375}
}