K5--SUBDIVISION IN 4-CONNECTED GRAPHS

被引：0
|
作者：
Lu, Changhong [1 ,2 ]
Zhang, Ping [1 ,2 ]
机构：
[1] East China Normal Univ, Sch Math Sci, Shanghai, Peoples R China
[2] East China Normal Univ, Shanghai Key Lab PMMP, Shanghai, Peoples R China
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2018年 / 32卷 / 04期
基金：
中国国家自然科学基金;
关键词：
K-5(-)-subdivision; internally disjoint paths; connectivity; contraction; FORBIDDEN SUBGRAPH CONDITIONS; CONTRACTILE EDGES;
D O I：
10.1137/18M1194973
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Hajos conjectured in 1961 that every k-chromatic graph contains a K-k-subdivision. In this paper, we consider the subdivision of K-5(-) and prove that every 4-connected graph contains a K-5(-)-subdivision. This may make progress for the case k = 5 of the Hajos' conjecture.
引用
收藏
页码：2900 / 2915
页数：16
相关论文
共 50 条
12345