{"title":"彩色的关联面图","authors":"Satyan L. Devadoss, Mia Smith","doi":"10.4310/joc.2023.v14.n3.a4","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":44683,"journal":{"name":"Journal of Combinatorics","volume":"44 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Colorful graph associahedra\",\"authors\":\"Satyan L. Devadoss, Mia Smith\",\"doi\":\"10.4310/joc.2023.v14.n3.a4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":44683,\"journal\":{\"name\":\"Journal of Combinatorics\",\"volume\":\"44 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2020-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/joc.2023.v14.n3.a4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/joc.2023.v14.n3.a4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
