Braid presentation of spatial graphs

DOI10.3836/TJM/1296483485MaRDI QIDQ632499zbMATH OpenOpenAlexFDO

Authors Ken Kanno, Kouki Taniyama

Publication date 25 March 2011

Published in Tokyo Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Abstract: We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy does not hold for spatial graphs.

Recommendations

• Planar graphs and presentations of braid groups
• scientific article; zbMATH DE number 591405
• Spatial graph as connected sum of a planar graph and a braid
• About presentations of braid groups and their generalizations
• Representation of links by braids: A new algorithm

Cites work

• Embedding knots and links in an open book. I: Basic properties
• On the braid index of?m-curve in 3-space
• The minimal number of Seifert circles equals the braid index of a link

Cited in

(6)

• The \(L\)-move and Markov theorems for trivalent braids
• Alexander- and Markov-type theorems for virtual trivalent braids
• Spatial graph as connected sum of a planar graph and a braid
• Design and serial construction of digraph braids
• Handlebody-knots and development of quandle theory
• Multiplicity of a space over another space

This page was built for publication: Braid presentation of spatial graphs

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