Skip navigation
Skip navigation

Entanglement of embedded graphs

Castle, Toen; Evans, Myfanwy; Hyde, Stephen


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.

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
Source: Progress in Theoretical Physics Supplement
DOI: 10.1143/PTPS.191.235


File Description SizeFormat Image
01_Castle_Entanglement_of_embedded_2011.pdf668.58 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator