A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
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.fatcat:zt2ainphpzdcdo6jlfih6dffi4