Bicycles and left–right tours in locally finite graphs

详细信息    查看全文

• 作者：Henning Bruhn ; Stefanie Kosuch ; Melanie Win Myint
• 刊名：European Journal of Combinatorics
• 出版年：2009
• 出版时间：February 2009
• 年：2009
• 卷：30
• 期：2
• 页码：356-371
• 全文大小：1014 K

文摘

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.