Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
Journal of Graph Theory · 2020-07 · 94 (3) · 349-363
DOI: 10.1002/jgt.22526 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 27.11.2019. Verfasst von Songling Shan. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 11 Literaturangaben.
Abstract (Originalsprache)
A graph is called ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough ‐free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.
Zitieren
APA
Shan, S. (2020). Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs. Journal of Graph Theory, 94(3), 349-363. https://doi.org/10.1002/jgt.22526
Vancouver
Shan S. Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs. Journal of Graph Theory. 2020;94(3):349-363. doi:10.1002/jgt.22526
BibTeX
@article{Shan2020,
author = {Shan, Songling},
title = {Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs},
journal = {Journal of Graph Theory},
year = {2020},
volume = {94},
number = {3},
pages = {349--363},
doi = {10.1002/jgt.22526}
}
EUVIMED