Lattice stick number of spatial graphs
From MaRDI portal
Publication:4579870
Abstract: The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number of spatial graphs with vertices of degree at most six (necessary for embedding into the cubic lattice), and present an upper bound in terms of the crossing number s_{L}(G) leq 3c(G)+6e-4v-2s+3b+k, where has edges, vertices, cut-components, bouquet cut-components, and knot components.
Recommendations
Cites work
- scientific article; zbMATH DE number 1187105 (Why is no real title available?)
- scientific article; zbMATH DE number 1877232 (Why is no real title available?)
- AN UPPER BOUND ON EDGE NUMBERS OF 2-BRIDGE KNOTS AND LINKS
- An upper bound of arc index of links
- An upper bound on stick number of knots
- Knots with small lattice stick numbers
- LATTICE STICK NUMBERS OF SMALL KNOTS
- Links with small lattice stick numbers
- MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
- Polygon Indices and Superbridge Indices of Torus Knots and Links
- Ramsey Theorems for Knots, Links and Spatial Graphs
- STICK INDEX OF KNOTS AND LINKS IN THE CUBIC LATTICE
- Stick number of spatial graphs
- Stick numbers of 2-bridge knots and links
- The Curvature of Lattice Knots
- Upper bound on lattice stick number of knots
Cited in
(6)- Lattice conformation of theta-curves accompanied with Brunnian property
- Circuit presentation and lattice stick number with exactly four \(z\)-sticks
- Stick number of non-paneled knotless spatial graphs
- Upper bound on lattice stick number of knots
- Stick number of spatial graphs
- Lattice stick number of knots
This page was built for publication: Lattice stick number of spatial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579870)