Identifiable projections of spatial graphs

Youngsik Huh*, Kouki Taniyama

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


A generic map from a finite graph to the 2-space is called identifiable if any two embeddings of the graph into the 3-space obtained by lifting the map with respect to the natural projection from the 3-space to the 2-space are ambient isotopic in the 3-space. We show that only planar graphs have identifiable maps. We characterize the identifiable maps for some planar graphs.

Original languageEnglish
Pages (from-to)991-998
Number of pages8
JournalJournal of Knot Theory and its Ramifications
Issue number8
Publication statusPublished - 2004 Dec


  • Identifiable projection
  • Regular projection
  • Spatial graphs

ASJC Scopus subject areas

  • Algebra and Number Theory


Dive into the research topics of 'Identifiable projections of spatial graphs'. Together they form a unique fingerprint.

Cite this