On the diameter of tree associahedra

zbMath1398.05060arXiv1803.11427MaRDI QIDQ1991427

Stefan Langerman, Jean Cardinal, Pablo Pérez-Lantero

Publication date: 30 October 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

diameterassociahedra

Mathematics Subject Classification ID

Trees (05C05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Distance in graphs (05C12)

Related Items (4)

Multivariate polynomials for generalized permutohedra ⋮ The rotation distance of brooms ⋮ Diameter estimates for graph associahedra ⋮ Competitive Online Search Trees on Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Hitting sets online and unique-MAX coloring
• Greedoids
• On the rotation distance between binary trees
• Graph properties of graph associahedra
• A realization of graph associahedra
• Local optimization on graphs
• Predicting the structure of sparse orthogonal factors
• Finding minimum height elimination trees for interval graphs in polynomial time
• The associahedron and triangulations of the \(n\)-gon
• Optimal node ranking of tree in linear time
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Many non-equivalent realizations of the associahedron
• The diameter of associahedra
• Coxeter complexes and graph-associahedra
• The asymptotic diameter of cyclohedra
• Permutohedra, Associahedra, and Beyond
• Lower Bounds for Accessing Binary Search Trees with Rotations
• Introduction to Greedoids
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Rankings of Graphs
• Bit Reversal on Uniprocessors
• Deterministic and probabilistic binary search in graphs
• Homotopy Associativity of H-Spaces. I

This page was built for publication: On the diameter of tree associahedra