Hamiltonian cycles in 3-tough 2K2-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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.