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 mathbbR3.












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)