Generalizing Nestohedra and graph associahedra for simple polytopes
From MaRDI portal
Publication:2199837
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Graph theory (05C99) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Recommendations
Cites work
- A realization of graph associahedra
- Combinatorial realization of the Hopf algebra of sashes
- Coxeter complexes and graph-associahedra
- Coxeter-bicatalan combinatorics
- Faces of generalized permutohedra
- Generalized associahedra via quiver representations
- Incidence combinatorics of resolutions
- Marked tubes and the graph multiplihedron
- On stretching the interval simplex-permutohedron
- Permutohedra, Associahedra, and Beyond
Cited in
(10)- Algebraic structures on graph associahedra
- Convex polytopes from nested posets
- Pseudograph associahedra
- Hypergraph polytopes
- Lattices from graph associahedra
- Symmetric graphicahedra
- Geometrical realisations of the simple permutoassociahedron by Minkowski sums
- Generating aspect graphs for nonconvex polyhedra
- Between graphical zonotope and graph-associahedron
- Generalized Tamari order
This page was built for publication: Generalizing Nestohedra and graph associahedra for simple polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199837)