Braid presentation of spatial graphs

Simple item page
dc.creatorKanno, Ken
dc.creatorTaniyama, Kouki
dc.date2009-01-12
dc.date.accessioned2026-07-07T12:28:22Z
dc.date.available2026-07-07T12:28:22Z
dc.descriptionWe 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.
dc.description13 pages, 15 figures
dc.identifierhttps://arxiv.org/abs/0901.1511
dc.identifierhttp://arxiv.org/abs/0901.1511
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215519
dc.subjectGeometric Topology
dc.subject57M25; 57M15
dc.titleBraid presentation of spatial graphs
dc.typetext

Files

Collections

arXiv