Newly found forbidden graphs for trivializability

Ryo Nikkuni, Makoto Ozawa, Kouki Taniyama, Yukihiro Tsutsumi

研究成果: Article査読

3 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)523-538
ページ数16
ジャーナルJournal of Knot Theory and its Ramifications
14
4
DOI
出版ステータスPublished - 2005 6

ASJC Scopus subject areas

  • 代数と数論

フィンガープリント

「Newly found forbidden graphs for trivializability」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル