3-trees in polyhedral maps
From MaRDI portal
Publication:1802763
DOI10.1007/BF02808218zbMATH Open0770.05041OpenAlexW2058839962MaRDI QIDQ1802763FDOQ1802763
Authors: D. W. Barnette
Publication date: 29 June 1993
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02808218
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Three-dimensional polytopes (52B10) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
Cited In (13)
- Trees of nuclei and bounds on the number of triangulations of the 3-ball
- Decomposition theorems for the torus, projective plane and Klein bottle
- Spanning trees: A survey
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- A characterization of partial 3-trees
- On spanning trees and walks of low maximum degree
- Title not available (Why is that?)
- Trees in triangulations
- Face-width of embedded graphs
- 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
- Three-Dimensional Drawings of Bounded Degree Trees
- Characterization and Recognition of Partial 3-Trees
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)