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 条
  • [41] Chain decompositions and independent trees in 4-connected graphs
    Curran, S
    Lee, O
    Yu, XX
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 186 - 191
  • [42] 4-connected projective-planar graphs are hamiltonian-connected
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 378 - 395
  • [43] 4-connected projective-planar graphs are Hamiltonian-connected
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 112 : 36 - 69
  • [44] A NEW PROOF THAT 4-CONNECTED PLANAR GRAPHS ARE HAMILTONIAN-CONNECTED
    Lu, Xiaoyun
    West, Douglas B.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 555 - 564
  • [45] Removable edges in longest cycles of 4-connected graphs
    Wu, JC
    Li, XL
    GRAPHS AND COMBINATORICS, 2004, 20 (03) : 413 - 422
  • [46] Compact visibility representation of 4-connected plane graphs
    He, Xin
    Wang, Jiun-Jie
    Zhang, Huaming
    THEORETICAL COMPUTER SCIENCE, 2012, 447 : 62 - 73
  • [47] Non-separating paths in 4-connected graphs
    Kawarabayashi, Ken-ichi
    Lee, Orlando
    Yu, Xingxing
    ANNALS OF COMBINATORICS, 2005, 9 (01) : 47 - 56
  • [48] Removable Edges in Longest Cycles of 4-Connected Graphs
    Jichang Wu
    Xueliang Li
    Graphs and Combinatorics, 2004, 20 : 413 - 422
  • [49] CONTRACTILE EDGES IN 4-CONNECTED MAXIMAL PLANAR GRAPHS
    MCCUAIG, WD
    HAGLIN, DJ
    VENKATESAN, SM
    ARS COMBINATORIA, 1991, 31 : 199 - 203
  • [50] ON LONGEST CYCLES IN ESSENTIALLY 4-CONNECTED PLANAR GRAPHS
    Fabrici, Igor
    Harant, Jochen
    Jendrol', Stanislav
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 565 - 575
12345