Colorful Graph Associahedra
2020
Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a collection of simple abstract polytopes, and explore its properties.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
13
References
0
Citations
NaN
KQI