Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
Journal of Graph Theory · 2022-12 · 101 (4) · 769-781
DOI: 10.1002/jgt.22852 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 20.06.2022. Verfasst von Katsuhiro Ota und 1 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 10 Literaturangaben.
Abstract (Originalsprache)
A graph is called a ‐free graph if it does not contain as an induced subgraph. In 2014, Broersma, Patel, and Pyatkin showed that every 25‐tough ‐free graph on at least three vertices is Hamiltonian. Recently, Shan improved this result by showing that 3‐tough is sufficient instead of 25‐tough. In this paper, we show that every 2‐tough ‐free graph on at least three vertices is Hamiltonian, which was conjectured by Gao and Pasechnik.
Zitieren
APA
Ota, K., & Sanka, M. (2022). Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs. Journal of Graph Theory, 101(4), 769-781. https://doi.org/10.1002/jgt.22852
Vancouver
Ota K, Sanka M. Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs. Journal of Graph Theory. 2022;101(4):769-781. doi:10.1002/jgt.22852
BibTeX
@article{Ota2022,
author = {Ota, Katsuhiro and Sanka, Masahiro},
title = {Hamiltonian cycles in 2‐tough 2K2 $2K_2$‐free graphs},
journal = {Journal of Graph Theory},
year = {2022},
volume = {101},
number = {4},
pages = {769--781},
doi = {10.1002/jgt.22852}
}
EUVIMED