scientific article; zbMATH DE number 6770102
From MaRDI portal
Publication:5355044
Recommendations
- On a connection between the existence of k-trees and the toughness of a graph
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Toughness and Hamiltonicity in k-trees
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- scientific article; zbMATH DE number 568844
- scientific article; zbMATH DE number 7084989
- On connectivities of tree graphs
- A new result about panconnectivity on graphs
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- Spanning \(k\)-trees of \(n\)-connected graphs
Cited in
(5)- Pendant tree-connectivity
- On a connection between the existence of k-trees and the toughness of a graph
- Long paths and toughness of \(k\)-trees and chordal planar graphs
- scientific article; zbMATH DE number 1161291 (Why is no real title available?)
- scientific article; zbMATH DE number 7084989 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355044)
