{"title":"图的团数和一些哈密顿性质","authors":"Rao Li","doi":"10.47443/cm.2021.0038","DOIUrl":null,"url":null,"abstract":"Abstract A graph is said to be Hamiltonian (respectively, traceable) if it has a Hamiltonian cycle (respectively, Hamiltonian path), where a Hamiltonian cycle (respectively, Hamiltonian path) is a cycle (respectively, path) containing all the vertices of the graph. In this short note, sufficient conditions involving the clique number for the Hamiltonian and traceable graphs are presented.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Clique Number and Some Hamiltonian Properties of Graphs\",\"authors\":\"Rao Li\",\"doi\":\"10.47443/cm.2021.0038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A graph is said to be Hamiltonian (respectively, traceable) if it has a Hamiltonian cycle (respectively, Hamiltonian path), where a Hamiltonian cycle (respectively, Hamiltonian path) is a cycle (respectively, path) containing all the vertices of the graph. In this short note, sufficient conditions involving the clique number for the Hamiltonian and traceable graphs are presented.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.47443/cm.2021.0038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.47443/cm.2021.0038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Clique Number and Some Hamiltonian Properties of Graphs
Abstract A graph is said to be Hamiltonian (respectively, traceable) if it has a Hamiltonian cycle (respectively, Hamiltonian path), where a Hamiltonian cycle (respectively, Hamiltonian path) is a cycle (respectively, path) containing all the vertices of the graph. In this short note, sufficient conditions involving the clique number for the Hamiltonian and traceable graphs are presented.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
