{"title":"一个关于图特路径的托马森定理的简短证明","authors":"K. Ozeki","doi":"10.55937/sut/1424794984","DOIUrl":null,"url":null,"abstract":"A graph is said to be Hamiltonian-connected if there exists a Hamiltonian path between any given pair of distinct vertices. In 1983, Thomassen proved that every 4-connected plane graph is Hamiltonian-connected, using the concept of Tutte subgraph. In this paper, we give a new proof to Thomassen’s theorem.","PeriodicalId":38708,"journal":{"name":"SUT Journal of Mathematics","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A shorter proof of Thomassen’s theorem on Tutte paths in plane graphs\",\"authors\":\"K. Ozeki\",\"doi\":\"10.55937/sut/1424794984\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph is said to be Hamiltonian-connected if there exists a Hamiltonian path between any given pair of distinct vertices. In 1983, Thomassen proved that every 4-connected plane graph is Hamiltonian-connected, using the concept of Tutte subgraph. In this paper, we give a new proof to Thomassen’s theorem.\",\"PeriodicalId\":38708,\"journal\":{\"name\":\"SUT Journal of Mathematics\",\"volume\":\"12 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SUT Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55937/sut/1424794984\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SUT Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55937/sut/1424794984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
A shorter proof of Thomassen’s theorem on Tutte paths in plane graphs
A graph is said to be Hamiltonian-connected if there exists a Hamiltonian path between any given pair of distinct vertices. In 1983, Thomassen proved that every 4-connected plane graph is Hamiltonian-connected, using the concept of Tutte subgraph. In this paper, we give a new proof to Thomassen’s theorem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
