Bicycles and left-right tours in locally finite graphs
Bicycles and left-right tours in locally finite graphs
复制标题
DOI:
10.1016/j.ejc.2008.06.002
复制
发表时间:
2009-02
期刊:
影响因子:
--
通讯作者:
H. Bruhn;Stefanie Kosuch;Melanie Win Myint
中科院分区:
文献类型:
--
作者:
H. Bruhn;Stefanie Kosuch;Melanie Win Myint
We extend three results involving bicycles and left–right tours to infinite, locally finite graphs: Read and Rosenstiehl’s tripartition theorem, Shank’s theorem that the residues of left–right tours generate the bicycle space and the planarity criterion of Archdeacon, Bonnington and Little. In order to achieve this it is necessary to allow infinite cycles as defined by Diestel and Kühn.