Premium
Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
Author(s) -
Shan Songling
Publication year - 2020
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22526
Subject(s) - combinatorics , mathematics , induced subgraph , hamiltonian path , graph , pancyclic graph , hamiltonian (control theory) , factor critical graph , discrete mathematics , line graph , graph power , pathwidth , vertex (graph theory) , mathematical optimization
A graph is called 2 K 2 ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough 2 K 2 ‐free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.