Planar graphs producing no strongly almost trivial embedding

Youngsik Huh, Seungsang Oh

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We present here infinitely many planar graphs which have no strongly almost trivial embeddings. Then we conclude that "strongly almost trivial" is more strict concept than "almost trivial."

Original languageEnglish
Pages (from-to)319-326
Number of pages8
JournalJournal of Graph Theory
Volume43
Issue number4
DOIs
Publication statusPublished - 2003 Aug

Keywords

  • Knot
  • Planar graph
  • Projection
  • θ-Curve

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Planar graphs producing no strongly almost trivial embedding'. Together they form a unique fingerprint.

  • Cite this