EUVIMEDEUVIMED entdecken
Crossref

Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs

Katsuhiro Ota, Masahiro Sanka

Discrete Mathematics · 2024-03 · 347 (3) · 113841

DOI: 10.1016/j.disc.2023.113841 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics, 2024-03. Verfasst von Katsuhiro Ota und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 15 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science, Japan Science and Technology Agency.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_2 \cup kK_1)$-free if it does not contain $K_2 \cup kK_1$ as an induced subgraph. Recently, Shi and Shan conjectured that every $1$-tough and $2k$-connected $(K_2 \cup kK_1)$-free graph is hamiltonian. In this paper, we solve this conjecture by proving the statement; every $1$-tough and $k$-connected $(K_2 \cup kK_1)$-free graph with minimum degree at least $\frac{3(k-1)}{2}$ is hamiltonian or the Petersen graph.

Förderung

  • Japan Society for the Promotion of Science
  • Japan Science and Technology Agency

Zitieren

APA

Ota, K., & Sanka, M. (2024). Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs. Discrete Mathematics, 347(3), 113841. https://doi.org/10.1016/j.disc.2023.113841

Vancouver

Ota K, Sanka M. Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs. Discrete Mathematics. 2024;347(3):113841. doi:10.1016/j.disc.2023.113841

BibTeX
@article{Ota2024,
  author = {Ota, Katsuhiro and Sanka, Masahiro},
  title = {Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs},
  journal = {Discrete Mathematics},
  year = {2024},
  volume = {347},
  number = {3},
  pages = {113841},
  doi = {10.1016/j.disc.2023.113841}
}
Kostenlos starten →