Toughness, trees, and walks
From MaRDI portal
Recommendations
Cited in
(39)- On 2-walks in chordal planar graphs
- On a connection between the existence of k-trees and the toughness of a graph
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Spanning trees and spanning closed walks with small degrees
- The Chvátal-Erdős condition for prism-Hamiltonicity
- Spanning trees and spanning Eulerian subgraphs with small degrees
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- On the pancyclicity of lexicographic products
- Toughness in graphs -- a survey
- A note on interconnecting matchings in graphs
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Graph toughness from Laplacian eigenvalues
- Connected (g,f)-factors
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Edge-dominating cycles, k-walks and Hamilton prisms in 2K₂-free graphs
- Computing 2-walks in polynomial time
- Forbidden subgraphs and the existence of a 2-walk
- scientific article; zbMATH DE number 68918 (Why is no real title available?)
- Computing 2-walks in polynomial time
- scientific article; zbMATH DE number 786140 (Why is no real title available?)
- scientific article; zbMATH DE number 7075896 (Why is no real title available?)
- A toughness condition for a spanning tree with bounded total excesses
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- The spanning k-trees, perfect matchings and spectral radius of graphs
- A \(k\)-tree containing specified vertices
- Degree bounded spanning trees
- Binding numbers and connected factors
- Spanning trees: A survey
- Spanning k-trees and distance signless Laplacian spectral radius of graphs
- The \(A_{\alpha}\)-spectral radius and spanning trees of graphs
- Sufficient conditions for k-factors and spanning trees of graphs
- Sufficient conditions for k-factor-critical graphs and spanning k-trees of graphs
- A result on spanning trees with bounded total excess
- Eigenvalues and factors: a survey
- On prism-Hamiltonian bipartite graphs and toughness
- A proof of Haemers's toughness conjecture
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
- A note on k-walks in bridgeless graphs
This page was built for publication: Toughness, trees, and walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948506)