Graph properties of graph associahedra

zbMATH Open1326.05041arXiv1409.8114MaRDI QIDQ896785FDOQ896785

T. Manneville, Vincent Pilaud

Publication date: 14 December 2015

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

Abstract: 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.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 3914360
• A realization of graph associahedra
• Graph properties and invariants, by their associated matrices
• scientific article; zbMATH DE number 2108128
• Some properties of a graph associated to a lattice
• Publication:4862337
• Graphs associated with simplicial complexes
• PROPERTIES OF ARRANGEMENT GRAPHS
• A property of graphs of convex polytopes
• A Property of N-Graphs

zbMATH Keywords

Hamiltonian cyclegraph diametergraph associahedronnestohedron

Mathematics Subject Classification ID

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

Cited In (19)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896785)