机构:
Ewha Womans Univ, Dept Math, Seoul, South KoreaEwha Womans Univ, Dept Math, Seoul, South Korea
Kim, Younjin
[1
]
Lee, Sang June
论文数: 0引用数: 0
h-index: 0
机构:
Duksung Womens Univ, Dept Math, Seoul, South KoreaEwha Womans Univ, Dept Math, Seoul, South Korea
Lee, Sang June
[2
]
Oum, Sang-il
论文数: 0引用数: 0
h-index: 0
机构:
Korea Adv Inst Sci & Technol, Dept Math Sci, Daejeon, South Korea
KIAS, Sch Math, Seoul, South KoreaEwha Womans Univ, Dept Math, Seoul, South Korea
Oum, Sang-il
[3
,4
]
机构:
[1] Ewha Womans Univ, Dept Math, Seoul, South Korea
[2] Duksung Womens Univ, Dept Math, Seoul, South Korea
[3] Korea Adv Inst Sci & Technol, Dept Math Sci, Daejeon, South Korea
Dynamic coloring;
Minor-free graph;
Four color theorem;
Hadwiger's conjecture;
LOCAL CHROMATIC NUMBER;
CONJECTURE;
D O I:
10.1016/j.dam.2016.01.022
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
We prove that every simple connected graph with no K5 minor admits a proper 4-coloring such that the neighborhood of each vertex v having more than one neighbor is not monochromatic, unless the graph is isomorphic to the cycle of length 5. This generalizes the result on planar graphs by 5.-J. Kim, W.J. Park and the second author [Discrete Appl. Math. 161 (2013) 2207-22121. (C) 2016 Elsevier B.V. All rights reserved.
机构:
Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo, Japan
JST ERATO Kawarabayashi Project, Chiyoda Ku, Tokyo, JapanNatl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo, Japan
Kawarabayashi, Ken-ichi
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013),
2013,
: 985
-
1003