无立方顶点的多面体是棱-汉密尔顿多面体

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-02-19 DOI:10.1002/jgt.23078

Simon Špacapan

{"title":"无立方顶点的多面体是棱-汉密尔顿多面体","authors":"Simon Špacapan","doi":"10.1002/jgt.23078","DOIUrl":null,"url":null,"abstract":"The prism over a graph <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is the Cartesian product of <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> with the complete graph on two vertices. A graph <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is prism-hamiltonian if the prism over <math>\n <semantics>\n <mrow>\n <mi>G</mi>\n </mrow>\n <annotation> $G$</annotation>\n </semantics></math> is hamiltonian. We prove that every polyhedral graph (i.e., 3-connected planar graph) of minimum degree at least four is prism-hamiltonian.","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"106 2","pages":"380-406"},"PeriodicalIF":0.9000,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23078","citationCount":"0","resultStr":"{\"title\":\"Polyhedra without cubic vertices are prism-hamiltonian\",\"authors\":\"Simon Špacapan\",\"doi\":\"10.1002/jgt.23078\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prism over a graph <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is the Cartesian product of <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> with the complete graph on two vertices. A graph <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is prism-hamiltonian if the prism over <math>\\n <semantics>\\n <mrow>\\n <mi>G</mi>\\n </mrow>\\n <annotation> $G$</annotation>\\n </semantics></math> is hamiltonian. We prove that every polyhedral graph (i.e., 3-connected planar graph) of minimum degree at least four is prism-hamiltonian.\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"106 2\",\"pages\":\"380-406\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23078\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23078\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23078","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

图 G$G$ 上的棱是 G$G$ 与两个顶点上的完整图的笛卡尔积。如果 G$G$ 上的棱是哈密顿的，那么图 G$G$ 就是棱哈密顿的。我们证明了每一个最小阶数至少为四的多面体图（即三连平面图）都是棱-哈密顿图。

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

Polyhedra without cubic vertices are prism-hamiltonian

查看原文本刊更多论文

Polyhedra without cubic vertices are prism-hamiltonian

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e., 3-connected planar graph) of minimum degree at least four is prism-hamiltonian.

求助全文

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

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .