Spatial graph as connected sum of a planar graph and a braid
From MaRDI portal
Abstract: In this paper we show that every finite spatial graph is a connected sum of a planar graph, which is a forest, i.e. disjoint union of finite number of trees and a tangle. As a consequence we get that any finite spatial graph is a connected sum of a planar graph and a braid. Using these decompositions it is not difficult to find a set of generators and defining relations for the fundamental group of compliment of a spatial graph in 3-space .
Recommendations
- Braid presentation of spatial graphs
- Spatial graphs, tangles and plane trees
- Spatial graphs, knots and the cyclic polytope
- Knots in certain spatial graphs
- scientific article; zbMATH DE number 1160692
- Knots and links in certain spatial complete graphs
- scientific article; zbMATH DE number 3861193
- Planar graphs and presentations of braid groups
- A characterization of knots in a spatial graph
- Spatial graphs and their isotopy classification
Cites work
- A quick trip through knot theory
- Braid presentation of spatial graphs
- Category theoretic representations of knotted graphs in \(S^ 3\)
- Embedding knots and links in an open book II. Bounds on arc index
- Embedding knots and links in an open book. I: Basic properties
- scientific article; zbMATH DE number 795683 (Why is no real title available?)
- Invariants of Graphs in Three-Space
- Knots and links in spatial graphs
- Knotting probability of an arc diagram
- On the braid index of?m-curve in 3-space
- On transforming a spatial graph into a plane graph
Cited in
(4)
This page was built for publication: Spatial graph as connected sum of a planar graph and a braid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033073)