Séminaire Lotharingien de Combinatoire, B73d (2015), 31 pp.
Thibault Manneville and Vincent Pilaud
Graph Properties of Graph Associahedra
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and their Hamiltonicity. Our results extend known results for the classical associahedra (path associahedra) and permutahedra (complete graph associahedra). We also discuss partial extensions to the family of nestohedra.
Received: April 14, 2015.
Accepted: May 29, 2015.
The following versions are available: