当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The Kelmans-Seymour conjecture II: 2-Vertices in K4−
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2019-12-11 , DOI: 10.1016/j.jctb.2019.11.007 Dawei He , Yan Wang , Xingxing Yu
中文翻译:
Kelmans-Seymour猜想II:2-顶点
更新日期:2019-12-11
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2019-12-11 , DOI: 10.1016/j.jctb.2019.11.007 Dawei He , Yan Wang , Xingxing Yu
We use to denote the graph obtained from by removing an edge, and use to denote a subdivision of . Let G be a 5-connected nonplanar graph and such that with . Let be distinct. We show that G contains a in which is not a branch vertex, or contains , or G has a special 5-separation, or contains . This result will be used to prove the Kelmans-Seymour conjecture that every 5-connected nonplanar graph contains .
中文翻译:
Kelmans-Seymour猜想II:2-顶点
我们用 表示从获得的图 通过去除边缘,并使用 表示的细分 。令G为5连通的非平面图, 这样 与 。让与众不同。我们证明G包含一个 在其中 不是分支顶点,或者 包含 或G具有特殊的5分隔符,或 包含 。该结果将用于证明每个由5个连通的非平面图包含的Kelmans-Seymour猜想。