2020/11/16 by Satyan L. Devadoss, Devadoss, Satyan L., Mia Smith +1
Computer Science · Engineering · #05B30 #06A07 #52B11 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2011.08169
openalex publication_date 2020/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.