Bicycles and left-right tours in locally finite graphs

DOI10.1016/j.ejc.2008.06.002zbMath1229.05090OpenAlexW2148748987MaRDI QIDQ1003585

Melanie Win Myint, Henning Bruhn, Stefanie Kosuch

Publication date: 4 March 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.06.002

zbMATH Keywords

planarity criteriontripartition theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Infinite graphs (05C63)

Related Items (7)

On spanning tree packings of highly edge connected graphs ⋮ Bases and closures under infinite sums ⋮ On the homology of locally compact spaces with ends ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Graph topologies induced by edge lengths ⋮ Vertex-colored graphs, bicycle spaces and Mahler measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On infinite cycles. I, II
• The Gauss code problem off the plane
• MacLane's planarity criterion for locally finite graphs
• 3-connected planar spaces uniquely embed in the sphere
• Duality in Infinite Graphs
• Cycle spaces in topological spaces
• The bond and cycle spaces of an infinite graph
• On the Principal Edge Tripartition of a Graph
• An algebraic characterization of planar graphs
• The Cycle Space of an Infinite Graph
• Walks through every edge exactly twice II

This page was built for publication: Bicycles and left-right tours in locally finite graphs