TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS

DOI10.1142/S0218216508006336MaRDI QIDQ3519933zbMATH OpenOpenAlexFDO

Authors Blake Mellor

Publication date 19 August 2008

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0408286

zbMATH Keywords

treeintersection graphschord diagrams

Mathematics Subject Classification ID

Trees (05C05)

Abstract: In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term relations).

Recommendations

• TREE DIAGRAMS FOR STRING LINKS
• CHORD DIAGRAMS AND COXETER LINKS
• Chord diagrams, d-diagrams, and knots
• Chord diagram invariants of tangles and graphs
• Knot diagrams of treewidth two
• INTERSECTION GRAPHS FOR STRING LINKS
• On the tree-width of knot diagrams
• On the tree representation of chordal graphs
• Chordal 2-connected graphs and spanning trees
• Connected chord diagrams and bridgeless maps

Cites work

• INTERSECTION GRAPHS FOR STRING LINKS
• On a Hopf algebra in graph theory
• On the Vassiliev knot invariants
• THE INTERSECTION GRAPH CONJECTURE FOR LOOP DIAGRAMS
• TREE DIAGRAMS FOR STRING LINKS

Cited in

(5)

• CHORD DIAGRAMS AND COXETER LINKS
• Open string diagrams I: Topological type
• A few weight systems arising from intersection graphs
• INTERSECTION GRAPHS FOR STRING LINKS
• TREE DIAGRAMS FOR STRING LINKS

This page was built for publication: TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519933)