Planar graphs producing no strongly almost trivial embedding

Youngsik Huh, Seung Sang 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 1

Fingerprint

Planar graph
Trivial
Concepts

Keywords

  • θ-Curve
  • Knot
  • Planar graph
  • Projection

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Planar graphs producing no strongly almost trivial embedding. / Huh, Youngsik; Oh, Seung Sang.

In: Journal of Graph Theory, Vol. 43, No. 4, 01.08.2003, p. 319-326.

Research output: Contribution to journalArticle

@article{960597aa67d343c38ca9b9b576fdacee,
title = "Planar graphs producing no strongly almost trivial embedding",
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.{"}",
keywords = "θ-Curve, Knot, Planar graph, Projection",
author = "Youngsik Huh and Oh, {Seung Sang}",
year = "2003",
month = "8",
day = "1",
doi = "10.1002/jgt.10123",
language = "English",
volume = "43",
pages = "319--326",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - Planar graphs producing no strongly almost trivial embedding

AU - Huh, Youngsik

AU - Oh, Seung Sang

PY - 2003/8/1

Y1 - 2003/8/1

N2 - 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."

AB - 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."

KW - θ-Curve

KW - Knot

KW - Planar graph

KW - Projection

UR - http://www.scopus.com/inward/record.url?scp=0042738866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042738866&partnerID=8YFLogxK

U2 - 10.1002/jgt.10123

DO - 10.1002/jgt.10123

M3 - Article

VL - 43

SP - 319

EP - 326

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -