{"title":"Local Conditions for Cycles in Graphs","authors":"Jonas B. Granholm","doi":"10.3384/LIC.DIVA-156118","DOIUrl":null,"url":null,"abstract":"A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian ...","PeriodicalId":303036,"journal":{"name":"Linköping Studies in Science and Technology. Licentiate Thesis","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linköping Studies in Science and Technology. Licentiate Thesis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3384/LIC.DIVA-156118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian ...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
