Planarity Certificates

Lars Noschinski 🌐

November 11, 2015

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This development provides a formalization of planarity based on combinatorial maps and proves that Kuratowski's theorem implies combinatorial planarity. Moreover, it contains verified implementations of programs checking certificates for planarity (i.e., a combinatorial map) or non-planarity (i.e., a Kuratowski subgraph).


BSD License


Session Planarity_Certificates