Diameter estimates for graph associahedra
From MaRDI portal
Publication:2093260
DOI10.1007/s00026-022-00598-zzbMath1503.05029arXiv2106.16130OpenAlexW3213278555MaRDI QIDQ2093260
Lionel Pournin, Mario Valencia-Pabon, Jean Cardinal
Publication date: 7 November 2022
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.16130
(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Polytopes and polyhedra (52B99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- A counterexample to the Hirsch conjecture
- Graph properties of graph associahedra
- On low tree-depth decompositions
- Faces of generalized permutohedra
- Gal's conjecture for nestohedra corresponding to complete bipartite graphs
- Trivially perfect graphs
- Fundamental groups of blow-ups.
- Optimal node ranking of tree in linear time
- Realization of the Stasheff polytope
- Ordered colourings
- Quasi-threshold graphs
- On the diameter of tree associahedra
- The diameter of associahedra
- Coxeter complexes and graph-associahedra
- Real root conjecture fails for five- and higher-dimensional spheres
- The asymptotic diameter of cyclohedra
- Exploring the Subexponential Complexity of Completion Problems
- Permutohedra, Associahedra, and Beyond
- The Partial Order of a Polymatroid Extreme Point
- Convexity in Graphs and Hypergraphs
- Self-adjusting binary search trees
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Lower Bounds for Accessing Binary Search Trees with Rotations
- The Comparability Graph of a Tree
- Rankings of Graphs
- Bit Reversal on Uniprocessors
- Competitive Online Search Trees on Trees
- Dynamic Optimality—Almost
- Homotopy Associativity of H-Spaces. I
- Monoïdes préordonnés et chaînes de Malcev
