Pages that link to "Item:Q1120590"
From MaRDI portal
The following pages link to On a connection between the existence of k-trees and the toughness of a graph (Q1120590):
Displayed 28 items.
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- The existence of \(f\)-forests and \(f\)-trees in graphs (Q1720317) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Spanning trees and spanning closed walks with small degrees (Q2144593) (← links)
- The Chvátal-Erdős condition for prism-Hamiltonicity (Q2182179) (← links)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) (Q2259579) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- Long paths and cycles in tough graphs (Q2366213) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Connected (g, f)-factors (Q2778283) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- On the Power of Planned Infections in Networks (Q4985791) (← links)
- Spanning Trees with Vertices Having Large Degrees (Q5265330) (← links)
- Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Partitioning vertices of 1-tough graphs into paths (Q5941518) (← links)
- Toughness and spanning trees in K4‐minor‐free graphs (Q6055399) (← links)