Treetopes and their graphs

DOI10.1007/S00454-020-00177-0OpenAlexW2194367540MaRDI QIDQ2197683FDOQ2197683

Authors: David Eppstein 

Publication date: 1 September 2020

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03152

Recommendations

• Treetopes and their Graphs
• Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs))
• Tree polytope on 2-trees
• Einfache, konvexe Polytope und ihre Graphen
• Simple polytopes without small separators. II: Thurston's bound

zbMATH Keywords

treepolytopeskeletonHalin graphclustered planarity

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Graph representations (geometric and intersection representations, etc.) (05C62) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• Realization spaces of 4-polytopes are universal
• A linear algorithm for embedding planar graphs using PQ-trees
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient Planarity Testing
• Halin graphs and the travelling salesman problem
• Sparsity. Graphs, structures, and algorithms
• Title not available (Why is that?)
• Complexity of some geometric and topological problems
• Title not available (Why is that?)
• Convex Polytopes
• Finding small simple cycle separators for 2-connected planar graphs
• Planar Separators
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Recognizing Cartesian products in linear time
• A new planarity test
• A 3-approximation for the pathwidth of Halin graphs
• On the graph structure of convex polyhedra in \(n\)-space
• Planarity for clustered graphs
• Longest Simple Paths in Polyhedral Graphs
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• TRÉMAUX TREES AND PLANARITY
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Preassigning the shape of a face
• Finding a simple polytope from its graph in polynomial time
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of certain types of polyhedra
• Strongly sublinear separators and polynomial expansion
• Simple recognition of Halin graphs and their generalizations
• Approximation algorithms for polynomial-expansion and low-density graphs
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• Planarity Allowing Few Error Vertices in Linear Time

Cited In (6)

• Title not available (Why is that?)
• The topological trees with extreme Matula numbers
• Acyclic, connected and tree sets
• Title not available (Why is that?)
• Trees, ladders and graphs
• Title not available (Why is that?)

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 Q2197683)