On Toughness and Hamiltonicity of 2K2‐Free Graphs
From MaRDI portal
Publication:5417820
DOI10.1002/jgt.21734zbMath1292.05162DBLPjournals/jgt/BroersmaPP14OpenAlexW1997628570WikidataQ55969520 ScholiaQ55969520MaRDI QIDQ5417820
Viresh Patel, Artem V. Pyatkin, Hajo J. Broersma
Publication date: 22 May 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21734
Related Items (18)
Induced Separation Dimension ⋮ On hamiltonicity of 1-tough triangle-free graphs ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ The complexity of recognizing minimally tough graphs ⋮ Spanning trails with maximum degree at most 4 in \(2K_2\)-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 ⋮ Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs ⋮ Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ Isolated Rupture in Composite Networks ⋮ Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs ⋮ Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples ⋮ Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs ⋮ The induced separation dimension of a graph ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ Chvátal’s t 0-Tough Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Recognizing tough graphs is NP-hard
- Necessary conditions for Hamiltonian split graphs
- Finding Hamiltonian circuits in interval graphs
- On diameters and radii of bridged graphs
- Existence of dominating cycles and paths
- 1-tough cocomparability graphs are hamiltonian
- The toughness of split graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Toughness, hamiltonicity and split graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Toughness and the existence ofk-factors
- Tough spiders
This page was built for publication: On Toughness and Hamiltonicity of 2K2‐Free Graphs
