Another characterisation of planar graphs
A new characterisation of planar graphs is presented. It concerns the structure of the cocycle space of a graph, and is motivated by consideration of the dual of an elementary property enjoyed by sets of circuits in any graph.
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://www.combinatorics.org/V... (external link)