|
|||||
|
|
On strongly almost trivial embeddings of graphs |
|
| Authors: | Ryo Hanaki |
| Abstract: | We present four new classes of graphs, two of which every member has a strongly almost trivial embedding, and the other two of which every member has no strongly almost trivial embeddings. We show that the property that a graph has a strongly almost trivial embedding and the property that a graph has no strongly almost trivial embeddings are not inherited by minors. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory |
| Keywords: | strong almost trivial almost trivial spatial graph everywhere 1‐trivial |