A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Stick number of spatial graphs
[article]
2018
arXiv
pre-print
For a nontrivial knot K, Negami found an upper bound on the stick number s(K) in terms of its crossing number c(K) which is s(K) ≤ 2 c(K). Later, Huh and Oh utilized the arc index α(K) to present a more precise upper bound s(K) ≤3/2 c(K) + 3/2. Furthermore, Kim, No and Oh found an upper bound on the equilateral stick number s_=(K) as follows; s_=(K) ≤ 2 c(K) +2. As a sequel to this research program, we similarly define the stick number s(G) and the equilateral stick number s_=(G) of a spatial
arXiv:1806.09716v1
fatcat:7pbsof2nrffybn4o6cupjblzju