The Smallest Non-upper Embeddable 2-Connected 3-Regular Simplicial Graphs

Li Deming; Liu Yanpei

doi:10.3969/j.issn.1673-0291.1998.02.002

Home>Articles>The Smallest Non-upper Embeddable 2-Connected 3-Regular Simplicial Graphs

DOI: 10.3969/j.issn.1673-0291.1998.02.002

The Smallest Non-upper Embeddable 2-Connected 3-Regular Simplicial Graphs

Li Deming

Liu Yanpei

Abstract：It is shown that the smallest order of a non-upper embeddable 2-connected 3-regular simplicial graphs is eighteen. In other words, all 2-connected 3-regular simplicial graphs with order less than eighteen is up-embeddable.

Keywords：non-upper embeddability 2-connected 3-regular simplicial graph

Publication Date：1998-01-01

Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)

BEIFANG JIAOTONG DAXUE XUEBAO

PKUISTIC

ISSN：1673-0291

Year, Vol.(Issue)：1998,22(2)