Entanglement of embedded graphs

Toen Castle; Myfanwy E. Evans; Stephen T. Hyde

doi:10.1143/PTPS.191.235

Entanglement of embedded graphs

Toen Castle^*, Myfanwy E. Evans, Stephen T. Hyde

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

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.

Original language	English
Pages (from-to)	235-244
Number of pages	10
Journal	Progress of Theoretical Physics Supplement
Issue number	191
DOIs	https://doi.org/10.1143/PTPS.191.235
Publication status	Published - 2011

Access to Document

10.1143/PTPS.191.235

Cite this

@article{b90966b43dea42f3999f98d1a803a9b3,

title = "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.",

author = "Toen Castle and Evans, {Myfanwy E.} and Hyde, {Stephen T.}",

year = "2011",

doi = "10.1143/PTPS.191.235",

language = "English",

pages = "235--244",

journal = "Progress of Theoretical Physics Supplement",

issn = "0375-9687",

publisher = "Yukawa Institute for Theoretical Physics",

number = "191",

}

TY - JOUR

T1 - Entanglement of embedded graphs

AU - Castle, Toen

AU - Evans, Myfanwy E.

AU - Hyde, Stephen T.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84855326433&partnerID=8YFLogxK

U2 - 10.1143/PTPS.191.235

DO - 10.1143/PTPS.191.235

M3 - Article

SN - 0375-9687

SP - 235

EP - 244

JO - Progress of Theoretical Physics Supplement

JF - Progress of Theoretical Physics Supplement

IS - 191

ER -

Entanglement of embedded graphs

Abstract

Access to Document

Other files and links

Cite this