Planar graphs producing no strongly almost trivial embedding

Youngsik Huh; Seungsang Oh

doi:10.1002/jgt.10123

Planar graphs producing no strongly almost trivial embedding

Youngsik Huh, Seungsang Oh

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	319-326
Number of pages	8
Journal	Journal of Graph Theory
Volume	43
Issue number	4
DOIs	https://doi.org/10.1002/jgt.10123
Publication status	Published - 2003 Aug

Keywords

Knot
Planar graph
Projection
θ-Curve

ASJC Scopus subject areas

Geometry and Topology
Discrete Mathematics and Combinatorics

Access to Document

10.1002/jgt.10123

Cite this

@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 = "Knot, Planar graph, Projection, θ-Curve",

author = "Youngsik Huh and Seungsang Oh",

year = "2003",

month = aug,

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, Seungsang

PY - 2003/8

Y1 - 2003/8

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 - Knot

KW - Planar graph

KW - Projection

KW - θ-Curve

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

U2 - 10.1002/jgt.10123

DO - 10.1002/jgt.10123

M3 - Article

AN - SCOPUS:0042738866

SN - 0364-9024

VL - 43

SP - 319

EP - 326

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

Planar graphs producing no strongly almost trivial embedding

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this