论文信息 - MacLane's planarity criterion for locally finite graphs

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 [Graphentheorie, Bibliographisches Institut, Mannheim, 1970], we show that the topological cycle space introduced recently by Diestel and Kuhn allows a verbatim generalisation of MacLane's criterion to locally finite graphs. This then enables us to extend Kelmans' planarity criterion as well.

Maya Jakobine Stein | Henning Bruhn | H. Bruhn | M. Stein

[1] Carsten Thomassen,et al. Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] G. Dirac,et al. A Theorem of Kuratowski , 1954 .

[4] Reinhard Diestel,et al. The Cycle Space of an Infinite Graph , 2005, Combinatorics, Probability and Computing.

[5] Reinhard Diestel,et al. Topological paths, cycles and spanning trees in infinite graphs , 2004, Eur. J. Comb..

[6] Henning Bruhn,et al. Duality in Infinite Graphs , 2006, Combinatorics, Probability and Computing.

[7] Carsten Thomassen,et al. 3-connected planar spaces uniquely embed in the sphere , 2002 .

[8] Saunders Mac Lane,et al. A combinatorial condition for planar graphs , 1937 .

[9] C. Paul Bonnington,et al. Graphs Embedded in the Plane with Finitely Many Accumulation Points , 2001 .

[10] Henning Bruhn,et al. The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits , 2004, J. Comb. Theory, Ser. B.

[11] Reinhard Diestel,et al. Graph Theory , 1997 .

[12] Reinhard Diestel,et al. On Infinite Cycles II , 2004, Comb..

[13] C. Paul Bonnington,et al. Graphs embedded in the plane with a bounded number of accumulation points , 2003 .

[14] Reinhard Diestel,et al. On Infinite Cycles I , 2004, Comb..