Chord Diagrams and Gauss Codes for Graphs
| dc.creator | Fleming, Thomas | |
| dc.creator | Mellor, Blake | |
| dc.date | 2005-08-15 | |
| dc.date | 2006-02-28 | |
| dc.date.accessioned | 2026-07-07T06:42:47Z | |
| dc.date.available | 2026-07-07T06:42:47Z | |
| dc.description | 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. | |
| dc.description | 20 pages, many figures. This version has been substantially rewritten, and the results are stronger | |
| dc.identifier | https://arxiv.org/abs/math/0508269 | |
| dc.identifier | http://arxiv.org/abs/math/0508269 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102173 | |
| dc.subject | Combinatorics | |
| dc.subject | Geometric Topology | |
| dc.subject | 05C10; 57M15 | |
| dc.title | Chord Diagrams and Gauss Codes for Graphs | |
| dc.type | text |