Defective Coloring is Perfect for Minors
Defective Coloring is Perfect for Minors
复制标题
有缺陷的色彩非常适合未成年人
DOI:
10.1007/s00493-024-00081-8
复制
发表时间:
2024
期刊:
影响因子:
1.1
通讯作者:
Liu, Chun-Hung
中科院分区:
文献类型:
--
作者:
Liu, Chun-Hung
The defective chromatic number of a graph class is the infimumksuch that there exists an integerdsuch that every graph in this class can be partitioned into at mostkinduced subgraphs with maximum degree at mostd. Finding the defective chromatic number is a fundamental graph partitioning problem and received attention recently partially due to Hadwiger’s conjecture about coloring minor-closed families. In this paper, we prove that the defective chromatic number of any minor-closed family equals the simple lower bound obtained by the standard construction, confirming a conjecture of Ossona de Mendez, Oum, and Wood. This result provides the optimal list of unavoidable finite minors for infinite graphs that cannot be partitioned into a fixed finite number of induced subgraphs with uniformly bounded maximum degree. As corollaries about clustered coloring, we obtain a linear relation between the clustered chromatic number of any minor-closed family and the tree-depth of its forbidden minors, improving an earlier exponential bound proved by Norin, Scott, Seymour, and Wood and confirming the planar case of their conjecture.
登录
查看更多内容
DOI:
10.1137/141002177
发表时间:
2014
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
Katherine Edwards;D. Kang;Jaehoon Kim;Sang;P. Seymour
通讯作者:
P. Seymour
DOI:
10.1016/j.aam.2023.102489
发表时间:
2019-12
期刊:
Adv. Appl. Math.
影响因子:
--
作者:
Chun-Hung Liu;F. Wei
通讯作者:
Chun-Hung Liu;F. Wei
影响因子:
1.7
作者:
S. Norin;Zi
通讯作者:
Zi
DOI:
10.1017/s0305004100061521
发表时间:
1984
影响因子:
0.8
作者:
A. Thomason
通讯作者:
A. Thomason
影响因子:
1.1
作者:
P. D. Mendez;Sang;D. Wood
通讯作者:
D. Wood