一个完全明确的5-多面体图

Journal of Combinatorial Theory Pub Date : 1970-07-01 DOI:10.1016/S0021-9800(70)80053-9

David Barnette

{"title":"一个完全明确的5-多面体图","authors":"David Barnette","doi":"10.1016/S0021-9800(70)80053-9","DOIUrl":null,"url":null,"abstract":"<div>A 5-dimensional convex polytope P is constructed whose graph G has the property that if it is the graph a convex polytope P′ then P′ is combinatorially equivalent to P and, furthermore, G can be realized as the graph of P in only one way (i.e., if a subgraph of G determines a face of P it also determines a face of P′).</div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 1","pages":"Pages 44-53"},"PeriodicalIF":0.0000,"publicationDate":"1970-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80053-9","citationCount":"1","resultStr":"{\"title\":\"A completely unambiguous 5-polyhedral graph\",\"authors\":\"David Barnette\",\"doi\":\"10.1016/S0021-9800(70)80053-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>A 5-dimensional convex polytope P is constructed whose graph G has the property that if it is the graph a convex polytope P′ then P′ is combinatorially equivalent to P and, furthermore, G can be realized as the graph of P in only one way (i.e., if a subgraph of G determines a face of P it also determines a face of P′).</div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 1\",\"pages\":\"Pages 44-53\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80053-9\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

构造了一个5维凸多面体P，其图G具有这样的性质:如果是凸多面体P '的图，则P '与P组合等价，并且G只能以一种方式实现为P的图(即，如果G的子图确定了P的一个面，则它也确定了P '的一个面)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A completely unambiguous 5-polyhedral graph

A 5-dimensional convex polytope P is constructed whose graph G has the property that if it is the graph a convex polytope P′ then P′ is combinatorially equivalent to P and, furthermore, G can be realized as the graph of P in only one way (i.e., if a subgraph of G determines a face of P it also determines a face of P′).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory

自引率

0.00%

发文量