The following pages link to The diameter of associahedra (Q2450096):
Displaying 42 items.
- The diameter of type \(D\) associahedra and the non-leaving-face property (Q499452) (← links)
- \(W\)-associahedra have the non-leaving-face property (Q518200) (← links)
- Associahedra via spines (Q722343) (← links)
- Simultaneous flips on triangulated surfaces (Q1616279) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- The genus of curve, pants and flip graphs (Q1702343) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Once punctured disks, non-convex polygons, and pointihedra (Q1787972) (← links)
- Flipping in spirals (Q1984590) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Higher secondary polytopes and regular plabic graphs (Q2166326) (← links)
- Flip graphs, Yoke graphs and diameter (Q2209266) (← links)
- Non-leaving-face property for marked surfaces (Q2316940) (← links)
- A Motzkin filter in the Tamari lattice (Q2342623) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Compatibility fans for graphical nested complexes (Q2397100) (← links)
- Flip-graph moduli spaces of filling surfaces (Q2403282) (← links)
- Modular flip-graphs of one-holed surfaces (Q2408973) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- The asymptotic diameter of cyclohedra (Q2627989) (← links)
- NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON (Q2971049) (← links)
- Distances in Domino Flip Graphs (Q4575419) (← links)
- Edge Conflicts do not Determine Geodesics in the Associahedron (Q4638997) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- The geometry of flip graphs and mapping class groups (Q5234474) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- Curves on the torus intersecting at most <i>k</i> times (Q5889255) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Enumerative problems for arborescences and monotone paths on polytope graphs (Q6056794) (← links)
- Lagrangian fillings in \(A\)-type and their Kálmán loop orbits (Q6058043) (← links)
- Sampling planar tanglegrams and pairs of disjoint triangulations (Q6107829) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
- The rotation distance of brooms (Q6201876) (← links)
- Flip distance and triangulations of a polyhedron (Q6540258) (← links)
- On rotation distance of rank bounded trees (Q6593700) (← links)
- Rectangulotopes (Q6664142) (← links)
