Treetopes and their Graphs
From MaRDI portal
Abstract: We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one intersects the base in more than one point. We prove an equivalent characterization of the 4-treetopes using the concept of clustered planarity from graph drawing, and we use this characterization to recognize the graphs of 4-treetopes in polynomial time. This result provides one of the first classes of 4-polytopes, other than pyramids and stacked polytopes, that can be recognized efficiently from their graphs.
Recommendations
- Trees in Polyhedral Graphs
- On graphoidal graphs of a tree
- Topological mappings between graphs, trees and generalized trees
- Topological complexity of graphs and their spanning trees
- Vertex and tree arboricities of graphs
- scientific article; zbMATH DE number 1257229
- scientific article; zbMATH DE number 2044920
- scientific article; zbMATH DE number 3319306
- On tree roots of graphs
Cited in
(7)- Treetopes and their graphs
- scientific article; zbMATH DE number 6479553 (Why is no real title available?)
- scientific article; zbMATH DE number 5642074 (Why is no real title available?)
- scientific article; zbMATH DE number 2107061 (Why is no real title available?)
- Trees, ladders and graphs
- scientific article; zbMATH DE number 1406265 (Why is no real title available?)
- The topological trees with extreme Matula numbers
This page was built for publication: Treetopes and their Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575649)
