[isabelle] New AFP entry: Graph Theory

Graph Theory
Lars Noschinski

This development provides a formalization of directed graphs, supporting
(labelled) multi-edges and infinite graphs. A polymorphic edge type allows edges
to be treated as pairs of vertices, if multi-edges are not required. Formalized
properties are i.a. walks (and related concepts), connectedness and subgraphs
and basic properties of isomorphisms.

This formalization is used to prove characterizations of Euler Trails, Shortest
Paths and Kuratowski subgraphs.


This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.