Planar graphs producing no strongly almost trivial embedding
Youngsik Huh, Seungsang Oh · Journal of Graph Theory · 2003
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.”. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 319–326, 2003