On strongly almost trivial embeddings of graphs
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
almost trivial strong almost trivial spatial graph everywhere 1-trivial