Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
From MaRDI portal
Publication:5300503
DOI10.1137/110826345zbMATH Open1268.05047OpenAlexW1984457817MaRDI QIDQ5300503FDOQ5300503
Authors: Kenta Ozeki 
Publication date: 27 June 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7bf24d10e559eeb4052cc05d76c862fd4430c29c
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)
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cited In (10)
- On the Hamiltonian property hierarchy of 3-connected planar graphs
- Spanning trees with bounded total excess.
- On spanning trees and walks of low maximum degree
- Robust connectivity of graphs on surfaces
- 3-trees with few vertices of degree 3 in circuit graphs
- Upper bounds on the maximum degree of class two graphs on surfaces
- Subgraphs of graphs on surfaces with high representativity
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Title not available (Why is that?)
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)
