Paper Info
Title
Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
Abstract
A graph is called 2K2-free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25-tough 2K2-free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.
Year
DOI
Venue
2020
10.1002/jgt.22526
JOURNAL OF GRAPH THEORY
Keywords
DocType
Volume
2-factor,2K(2)-free graph,Hamiltonian cycle,toughness
Journal
94.0
Issue
ISSN
Citations 
3.0
0364-9024
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Songling Shan1209.16