Graph properties of graph associahedra

zbMath1326.05041arXiv1409.8114MaRDI QIDQ896785

Thibault Manneville, Vincent Pilaud

Publication date: 14 December 2015

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cyclegraph diametergraph associahedronnestohedron

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Multivariate polynomials for generalized permutohedra ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ The serpent nest conjecture for accordion complexes ⋮ Celebrating Loday's associahedron ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ The rotation distance of brooms ⋮ Lattices from graph associahedra and subalgebras of the Malvenuto-Reutenauer algebra ⋮ The diameter of type \(D\) associahedra and the non-leaving-face property ⋮ On the diameter of tree associahedra ⋮ A \(\tau\)-tilting approach to dissections of polygons ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ Lattices from graph associahedra ⋮ Diameter estimates for graph associahedra ⋮ Competitive Online Search Trees on Trees

This page was built for publication: Graph properties of graph associahedra