Entanglement of embedded graphs

Abstract

We discuss the identification of untangled graph embeddings for finite planar and nonplanar graphs as well as infinite crystallographic nets. Two parallel approaches are discussed: explicit 3-space embeddings and reticulations of 2-manifolds. 2D and 3D energies are proposed that allow ranking of (un)tangled embedding graphs. Show more