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."
- Planar graph
ASJC Scopus subject areas
- Geometry and Topology
- Discrete Mathematics and Combinatorics