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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
