Newly found forbidden graphs for trivializability

Ryo Nikkuni, Makoto Ozawa, Kouki Taniyama, Yukihiro Tsutsumi

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)523-538
    Number of pages16
    JournalJournal of Knot Theory and its Ramifications
    Volume14
    Issue number4
    DOIs
    Publication statusPublished - 2005 Jun

    Fingerprint

    Graph in graph theory
    Planar graph
    Minor
    Trivial
    Projection

    Keywords

    • Knotted projection
    • Spatial graph
    • Trivializable graph

    ASJC Scopus subject areas

    • Algebra and Number Theory

    Cite this

    Newly found forbidden graphs for trivializability. / Nikkuni, Ryo; Ozawa, Makoto; Taniyama, Kouki; Tsutsumi, Yukihiro.

    In: Journal of Knot Theory and its Ramifications, Vol. 14, No. 4, 06.2005, p. 523-538.

    Research output: Contribution to journalArticle

    Nikkuni, Ryo ; Ozawa, Makoto ; Taniyama, Kouki ; Tsutsumi, Yukihiro. / Newly found forbidden graphs for trivializability. In: Journal of Knot Theory and its Ramifications. 2005 ; Vol. 14, No. 4. pp. 523-538.
    @article{16798d0896714071b972ae3a298cb3fa,
    title = "Newly found forbidden graphs for trivializability",
    abstract = "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.",
    keywords = "Knotted projection, Spatial graph, Trivializable graph",
    author = "Ryo Nikkuni and Makoto Ozawa and Kouki Taniyama and Yukihiro Tsutsumi",
    year = "2005",
    month = "6",
    doi = "10.1142/S0218216505003932",
    language = "English",
    volume = "14",
    pages = "523--538",
    journal = "Journal of Knot Theory and its Ramifications",
    issn = "0218-2165",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "4",

    }

    TY - JOUR

    T1 - Newly found forbidden graphs for trivializability

    AU - Nikkuni, Ryo

    AU - Ozawa, Makoto

    AU - Taniyama, Kouki

    AU - Tsutsumi, Yukihiro

    PY - 2005/6

    Y1 - 2005/6

    N2 - 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.

    AB - 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.

    KW - Knotted projection

    KW - Spatial graph

    KW - Trivializable graph

    UR - http://www.scopus.com/inward/record.url?scp=21244441543&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=21244441543&partnerID=8YFLogxK

    U2 - 10.1142/S0218216505003932

    DO - 10.1142/S0218216505003932

    M3 - Article

    AN - SCOPUS:21244441543

    VL - 14

    SP - 523

    EP - 538

    JO - Journal of Knot Theory and its Ramifications

    JF - Journal of Knot Theory and its Ramifications

    SN - 0218-2165

    IS - 4

    ER -