In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Laneâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Henning Bruhn, Reinhard Diestel
- J. Comb. Theory, Ser. B
- 2009

Given a closed surface S, we characterise the graphs embeddable in S by an algebraic condition asserting the existence of aâ€¦Â (More)

Is this relevant?

2008

2008

Given a closed surface S, we characterise the graphs embeddable in S by an algebraic condition asserting the existence of aâ€¦Â (More)

Is this relevant?

2006

2006

- Henning Bruhn, Maya Jakobine Stein
- J. Comb. Theory, Ser. B
- 2006

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â€¦Â (More)

Is this relevant?

2006

2006

- HAMBURGER BEITRÃ„GE, ZUR MATHEMATIK, Henning Bruhn, Reinhard Diestel
- 2006

We generalise MacLaneâ€™s planarity criterion to surfaces of higher genus.Â

Is this relevant?

2005

2005

- Reinhard Diestel
- Combinatorics, Probability & Computing
- 2005

Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that buildsâ€¦Â (More)

Is this relevant?