{"title":"Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes","authors":"Branko Grünbaum","doi":"10.1016/S0021-9800(70)80071-0","DOIUrl":null,"url":null,"abstract":"<div><p>Abstract</p><p>The four-color problem concerning planar graphs is shown to have meaningful higher-dimensional analogs.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 2","pages":"Pages 147-153"},"PeriodicalIF":0.0000,"publicationDate":"1970-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80071-0","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
Abstract
The four-color problem concerning planar graphs is shown to have meaningful higher-dimensional analogs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
