Toughness, trees, and walks
From MaRDI portal
Publication:4948506
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X" /><125::AID-JGT1>3.0.CO;2-X 10.1002/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-XzbMath0951.05068OpenAlexW4251344975MaRDI QIDQ4948506
Publication date: 13 December 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200003)33:3<125::aid-jgt1>3.0.co;2-x
Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (24)
The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Spanning trees and spanning closed walks with small degrees ⋮ What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs ⋮ Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ A \(k\)-tree containing specified vertices ⋮ Degree bounded spanning trees ⋮ Binding numbers and connected factors ⋮ The Chvátal-Erdős condition for prism-Hamiltonicity ⋮ Forbidden subgraphs and the existence of a 2-walk ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Graph toughness from Laplacian eigenvalues ⋮ Spanning trees: A survey ⋮ A toughness condition for a spanning tree with bounded total excesses ⋮ Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs ⋮ On the pancyclicity of lexicographic products ⋮ Toughness in graphs -- a survey ⋮ Connected (g, f)-factors ⋮ A note on \(k\)-walks in bridgeless graphs ⋮ A note on interconnecting matchings in graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Unnamed Item ⋮ On 2-walks in chordal planar graphs ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees
This page was built for publication: Toughness, trees, and walks
