Mac Lane's planarity criterion

Known as: Mac Lane planarity criterion, MacLane planarity criterion, MacLane's planarity criterion 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

2005-2008
0120052008

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Given a closed surface S, we characterise the graphs embeddable in S by an algebraic condition asserting the existence of a… (More)
  • figure 2
  • figure 1
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
We generalise MacLane’s planarity criterion to surfaces of higher genus. 
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2005
2005
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that builds… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?