On a connection between the existence of k-trees and the toughness of a graph
From MaRDI portal
Publication:1120590
DOI10.1007/BF01788671zbMath0673.05054OpenAlexW2009946412MaRDI QIDQ1120590
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788671
Related Items (28)
The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Long paths and cycles in tough graphs ⋮ Spanning trees and spanning closed walks with small degrees ⋮ Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ A \(k\)-tree containing specified vertices ⋮ Degree bounded spanning trees ⋮ The Chvátal-Erdős condition for prism-Hamiltonicity ⋮ Toughness and spanning trees in K4‐minor‐free graphs ⋮ Improving upper bounds for the distinguishing index ⋮ Shape Measures of Random Increasing k-trees ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Graph toughness from Laplacian eigenvalues ⋮ On the approximability of some degree-constrained subgraph problems ⋮ The existence of \(f\)-forests and \(f\)-trees in graphs ⋮ Spanning trees: A survey ⋮ A toughness condition for a spanning tree with bounded total excesses ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) ⋮ Partitioning vertices of 1-tough graphs into paths ⋮ Toughness in graphs -- a survey ⋮ Connected (g, f)-factors ⋮ Drawing graphs as spanners ⋮ 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 ⋮ On the Power of Planned Infections in Networks ⋮ Toughness and prism-Hamiltonicity of \(P_4\)-free graphs ⋮ Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Spanning Trees with Vertices Having Large Degrees
Cites Work
This page was built for publication: On a connection between the existence of k-trees and the toughness of a graph
