Adam Kabela, Zdeněk Ryjáček, Mária Skyvová, Petr Vrána. Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected. // Discrete Mathematics. – 2025. – DOI: 10.1016/j.disc.2024.114305. – URL: https://doi.org/10.1016/j.disc.2024.114305
Adam Kabela, Zdeněk Ryjáček, Mária Skyvová, & Petr Vrána (2025). Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected. Discrete Mathematics. https://doi.org/10.1016/j.disc.2024.114305
Adam Kabela, et al. “Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected.” Discrete Mathematics, 2025. doi:10.1016/j.disc.2024.114305.
@article{Kabela2025,
title = {Every 3-connected \{K1,3,Γ3\}-free graph is Hamilton-connected},
author = {Kabela, Adam and Ryjáček, Zdeněk and Skyvová, Mária and Vrána, Petr},
journal = {Discrete Mathematics},
year = {2025},
doi = {10.1016/j.disc.2024.114305},
url = {https://doi.org/10.1016/j.disc.2024.114305}
}