当前位置: 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 III: 3-vertices in K4−
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2019-12-09 , DOI: 10.1016/j.jctb.2019.11.006
Dawei He , Yan Wang , Xingxing Yu

Let G be a 5-connected nonplanar graph and let x1,x2,y1,y2V(G) be distinct, such that G[{x1,x2,y1,y2}]K4 and y1y2E(G). We show that one of the following holds: Gx1 contains K4, or G contains a K4 in which x1 is of degree 2, or G contains a TK5 in which x1 is not a branch vertex, or {x2,y1,y2} may be chosen so that for any distinct z0,z1N(x1){x2,y1,y2}, G{x1v:v{z0,z1,x2,y1,y2}} contains TK5.



中文翻译:

凯尔曼-西摩猜想III:3个顶点 ķ4-

G为5连通非平面图,令X1个X2ÿ1个ÿ2VG 与众不同 G[{X1个X2ÿ1个ÿ2}]ķ4-ÿ1个ÿ2ËG。我们证明以下条件之一:G-X1个 包含 ķ4-,或G包含一个ķ4- 在其中 X1个是2级,或者G包含一个Ťķ5 在其中 X1个 不是分支顶点,或者 {X2ÿ1个ÿ2} 可以选择以便于任何不同的 ž0ž1个ñX1个-{X2ÿ1个ÿ2}G-{X1个vv{ž0ž1个X2ÿ1个ÿ2}} 包含 Ťķ5

更新日期:2019-12-09
down
wechat
bug