3-trees in polyhedral maps
From MaRDI portal
Publication:1802763
Recommendations
Cites work
Cited in
(13)- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- A characterization of partial 3-trees
- Trees of nuclei and bounds on the number of triangulations of the 3-ball
- On spanning trees and walks of low maximum degree
- scientific article; zbMATH DE number 609927 (Why is no real title available?)
- Trees in triangulations
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Decomposition theorems for the torus, projective plane and Klein bottle
- Three-Dimensional Drawings of Bounded Degree Trees
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Characterization and Recognition of Partial 3-Trees
- Spanning trees: A survey
- Face-width of embedded graphs
This page was built for publication: 3-trees in polyhedral maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802763)