Chord Diagrams and Gauss Codes for Graphs
From MaRDI portal
Publication:6475896
arXivmath/0508269MaRDI QIDQ6475896FDOQ6475896
Authors: Thomas Fleming, Blake Mellor 
Publication date: 15 August 2005
Abstract: Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of planar graphs and their intersection graphs, and prove some basic results. Then, as an application, we will introduce Gauss codes for immersions of graphs in the plane and give algorithms to determine whether a particular crossing sequence is realizable as the Gauss code of an immersed graph.
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
This page was built for publication: Chord Diagrams and Gauss Codes for Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475896)
