Lattice stick number of spatial graphs

Hyungkee Yoo, Chaeryn Lee, Seung Sang Oh

Research output: Contribution to journalArticlepeer-review


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 (Formula presented.) of spatial graphs (Formula presented.) 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 (Formula presented.) (Formula presented.) where (Formula presented.) has (Formula presented.) edges, (Formula presented.) vertices, (Formula presented.) cut-components, (Formula presented.) bouquet cut-components, and (Formula presented.) knot components.

Original languageEnglish
JournalJournal of Knot Theory and its Ramifications
Publication statusAccepted/In press - 2018 Jun 28


  • Graph
  • lattice stick number
  • upper bound

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'Lattice stick number of spatial graphs'. Together they form a unique fingerprint.

Cite this