Spanning trees in locally planar triangulations
From MaRDI portal
Publication:1333338
Recommendations
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- On spanning trees without vertices of degree 2 in plane triangulations
- On Short Noncontractible Cycles in Embedded Graphs
- On spanning trees and walks of low maximum degree
Cited in
(21)- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Disjoint paths, planarizing cycles, and spanning walks
- Spanning Eulerian subgraphs of bounded degree in triangulations
- On spanning trees and walks of low maximum degree
- Long cycles in graphs on a fixed surface
- On spanning trees without vertices of degree 2 in plane triangulations
- Subgraphs of graphs on surfaces with high representativity
- On Short Noncontractible Cycles in Embedded Graphs
- On the spanning tree polyhedron
- What is on his mind?
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Tree spanners in planar graphs
- Transforming spanning trees and pseudo-triangulations
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
- On the vertex-face graphs of triangulations
- Local routing in a tree metric 1-spanner
- Spanning triangulations in graphs
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Spanning trees: A survey
- Face-width of embedded graphs
This page was built for publication: Spanning trees in locally planar triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333338)
