Mac Lane's planarity criterion
id:
mac-lane-s-planarity-criterion-163-13771698
title:
Mac Lane's planarity criterion
text:
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 has a cycle basis in which each edge of the graph participates in at most two basis vectors.
brand slug:
wiki
category slug:
encyclopedia
description:
On cycle bases of planar graphs
original url:
https://en.wikipedia.org/wiki/Mac_Lane%27s_planarity_criterion
date created:
2004-07-05T04:55:49Z
date modified:
2024-08-29T01:04:43Z
main entity:
{"identifier":"Q6722305","url":"https://www.wikidata.org/entity/Q6722305"}
image:
fields total:
13
integrity:
15