Hamiltonian cycles in 3-tough 2K₂-free graphs
From MaRDI portal
Publication:5066893
Abstract: 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.
Recommendations
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
- A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
Cited in
(17)- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
- A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
- Edge-dominating cycles, k-walks and Hamilton prisms in 2K₂-free graphs
- scientific article; zbMATH DE number 5936422 (Why is no real title available?)
- K₂-Hamiltonian graphs: I
- On hamiltonicity of 1-tough triangle-free graphs
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
- Hamiltonicity of 1-tough (P₂ KP₁)-free graphs
- An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
- A Fan-type condition for cycles in 1-tough and k-connected (P₂ kP₁)-free graphs
- On minimally 1-tough (P₂ 3P₁)-free graphs
- Some conditions for pancyclicity in t-tough graphs
- Every 2k-connected (P₂ kP₁)-free graph with toughness greater than one is Hamiltonian-connected
- Hamilton cycles in tough (2P₂ P₁)-free graphs
This page was built for publication: Hamiltonian cycles in 3-tough \(2K_2\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066893)
