Mac Lane'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, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph participates in at most two basis vectors.
primaryTopic
Mac Lane'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, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which each edge of the graph participates in at most two basis vectors.
has abstract
In graph theory, Mac Lane's pl ...... in at most two basis vectors.
@en
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
672,392,150
hypernym
comment
In graph theory, Mac Lane's pl ...... in at most two basis vectors.
@en
label
Mac Lane's planarity criterion
@en