Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4045182 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 861394 (Why is no real title available?)
- scientific article; zbMATH DE number 867682 (Why is no real title available?)
- scientific article; zbMATH DE number 3310759 (Why is no real title available?)
- 1-tough cocomparability graphs are hamiltonian
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
- Depth-First Search and Linear Graph Algorithms
- Finding Hamiltonian circuits in interval graphs
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Graph theory
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Matching theory
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Recognizing tough graphs is NP-hard
- The Factors of Graphs
- The NP-completeness column: an ongoing guide
- Tough graphs and Hamiltonian circuits.
- Toughness and nonhamiltonicity of polyhedral graphs
- Toughness and the existence ofk-factors
- Toughness, minimum degree, and the existence of 2‐factors
- Two sufficient conditions for a 2-factor in a bipartite graph
Cited in
(48)- Toughness in graphs -- a survey
- Two completely independent spanning trees of split graphs
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs
- The complexity of recognizing minimally tough graphs
- Hamiltonicity in Split Graphs - A Dichotomy
- Long paths and toughness of \(k\)-trees and chordal planar graphs
- Toughness and Hamiltonicity in k-trees
- scientific article; zbMATH DE number 5936422 (Why is no real title available?)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- The complexity of recognizing tough cubic graphs
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
- Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
- Minimal toughness in special graph classes
- 1-tough cocomparability graphs are hamiltonian
- On the Burkard-Hammer condition for Hamiltonian split graphs
- Hamilton cycles and eigenvalues of graphs
- Bipartite toughness and \(k\)-factors in bipartite graphs
- Recognition of split-graphic sequences
- Toughness and spectral radius in graphs
- Toughness and Hamiltonicity of strictly chordal graphs
- Spanning connectivity of \(K_{1 , r}\)-free split graphs
- scientific article; zbMATH DE number 57115 (Why is no real title available?)
- Hamiltonian powers in threshold and arborescent comparability graphs
- Tough graphs and Hamiltonian circuits. (Reprint)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth
- 10-tough chordal graphs are Hamiltonian (extended abstract)
- Toughness and edge-toughness
- Toughness, forbidden subgraphs and pancyclicity
- Toughness, forbidden subgraphs, and Hamilton-connected graphs
- The toughness of split graphs
- Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
- Chordality and 2-factors in tough graphs
- Connected even factors in \(k\)-tree
- 10-tough chordal graphs are Hamiltonian
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
- Some properties of \(k\)-trees
- The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs
- The chromaticity of complete split graphs
- Toughness and nonhamiltonicity of polyhedral graphs
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
- A note on the approximability of the toughness of graphs
- A necessary condition for maximal nonhamiltonian Burkard-Hammer graphs
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Chvátal's \(t_{0}\)-tough conjecture
- Tough spiders
This page was built for publication: Toughness, hamiltonicity and split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916113)
