A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by giving some over/under informations to the double points. Every minor of a trivializable graph is also trivializable, thus the set of forbidden graphs is finite. Seven forbidden graphs for the trivializability were previously known. In this paper, we exhibit nine more forbidden graphs.
|ジャーナル||Journal of Knot Theory and its Ramifications|
|出版ステータス||Published - 2005 6月|
ASJC Scopus subject areas