期刊论文详细信息
Electronic Journal Of Combinatorics
Extending Cycles Locally to Hamilton Cycles
Matthias Hamann1 
关键词: Graph theory;    Hamilton cycles;    Infinite graphs;   
DOI  :  
学科分类:离散数学和组合数学
来源: Electronic Journal Of Combinatorics
PDF
【 摘 要 】

A Hamilton circle in an infinite graph is a homeomorphic copy of the  unit circle $S^1$ that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, e

【 授权许可】

Others   

【 预 览 】
附件列表
Files Size Format View
RO201909028332916ZK.pdf 357KB PDF download
  文献评价指标  
  下载次数:7次 浏览次数:18次