Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.jctb.2005.07.005 | J. Comb. Theory, Ser. B |
Keywords | DocType | Volume |
cycle space,planarity,infinite graphs,topological cycle space,planarity criterion state,planarity criterion,verbatim generalisation,basis b,bibliographisches institut,finite graph | Journal | 96 |
Issue | ISSN | Citations |
2 | Journal of Combinatorial Theory, Series B | 17 |
PageRank | References | Authors |
1.27 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| maya stein | 2 | 81 | 15.65 |