MacLane's planarity criterion for locally finite graphs

MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B. Solving a problem of Wagner (1970), we show that the topological cycle space introduced recently by Diestel and K

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Henning Bruhn, Maya Jakobine Stein
• Keywords: Cycle Space, Finite Graph, JCT 2006, Planarity Criterion