Braid presentation of spatial graphs
From MaRDI portal
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
Cites work
Cited in
(8)- Planar graphs and presentations of braid groups
- The L-move and Markov theorems for trivalent braids
- Design and serial construction of digraph braids
- Multiplicity of a space over another space
- Alexander- and Markov-type theorems for virtual trivalent braids
- Spatial graph as connected sum of a planar graph and a braid
- Handlebody-knots and development of quandle theory
- Foam cobordism and the Sah-Arnoux-Farhi invariant
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)