Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
From MaRDI portal
Recommendations
- Spanning trees with bounded degrees
- scientific article; zbMATH DE number 932184
- Spanning trees of bounded degree
- scientific article; zbMATH DE number 5174840
- Spanning trees with bounded degrees and leaves
- scientific article; zbMATH DE number 861354
- On spanning trees with restricted degrees
- On numbers of vertices of maximum degree in the spanning trees of a graph
- Tree spanners of bounded degree graphs
- Bounded degree spanning trees (extended abstract)
Cited in
(13)- 3-trees with few vertices of degree 3 in circuit graphs
- On 2-connected spanning subgraphs with low maximum degree
- Spanning trees in locally planar triangulations
- Subgraphs of graphs on surfaces with high representativity
- On the Hamiltonian property hierarchy of 3-connected planar graphs
- Upper bounds on the maximum degree of class two graphs on surfaces
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- On spanning trees and walks of low maximum degree
- Spanning trees with bounded total excess.
- Robust connectivity of graphs on surfaces
- scientific article; zbMATH DE number 5174840 (Why is no real title available?)
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Perfect hierarchical matchings in graphs
This page was built for publication: Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300503)
