Dynamic coloring of graphs having no K5 minor

被引：8

作者：

Kim, Younjin ^{[1
]}

Lee, Sang June ^{[2
]}

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

[4] KIAS, Sch Math, Seoul, South Korea

来源：

DISCRETE APPLIED MATHEMATICS | 2016年 / 206卷

基金：

新加坡国家研究基金会;

关键词：

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.

引用

页码：81 / 89

页数：9

共 50 条

[1] Coloring clique-hypergraphs of graphs with no subdivision of K5
Shan, Erfang
Kang, Liying
Theoretical Computer Science, 2015, 592 : 166 - 175
[2] Coloring clique-hypergraphs of graphs with no subdivision of K5
Shan, Erfang
Kang, Liying
THEORETICAL COMPUTER SCIENCE, 2015, 592 : 166 - 175
[3] COLORING ALGORITHMS FOR K5-MINOR FREE GRAPHS
KHULLER, S
INFORMATION PROCESSING LETTERS, 1990, 34 (04) : 203 - 208
[4] The total coloring of K5-minor-free graphs
Yang, Fan
Wu, Jianliang
EUROPEAN JOURNAL OF COMBINATORICS, 2022, 102
[5] The total coloring of K5-minor-free graphs
Yang, Fan
Wu, Jianliang
arXiv, 2021,
[6] 5-coloring K3,k-minor-free graphs
Kawarabayashi, Ken-ichi
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 985 - 1003
[7] Connected max cut is polynomial for graphs without the excluded minor K5\e
Chaourar, Brahim
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (04) : 869 - 875
[8] List-coloring clique-hypergraphs of K5-minor-free graphs strongly
Liang, Zuosong
Wu, Jianliang
Shan, Erfang
DISCRETE MATHEMATICS, 2020, 343 (04)
[9] Subdivisions of K5 in graphs containing K2,3
Kawarabayashia, Ken-ichi
Ma, Jie
Yu, Xingxing
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 113 : 18 - 67
[10] Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs
He, Jingxiang
Han, Ming
AXIOMS, 2024, 13 (06)

← 1 2 3 4 5 →