共 50 条
Equitable colorings of K4-minor-free graphs
被引:0
|作者:
de Joannis de Verclos R.
[1
]
Sereni J.-S.
[2
]
机构:
[1] Laboratoire G-SCOP, C.N.R.S. et Univ. Grenoble Alpes, Grenoble
[2] Centre National de la Recherche Scientifique, CSTB (ICube), Strasbourg
关键词:
D O I:
10.7155/jgaa.00451
中图分类号:
O144 [集合论];
O157 [组合数学(组合学)];
学科分类号:
070104 ;
摘要:
We demonstrate that for every positive integer ∆, every K4-minor-free graph with maximum degree ∆ admits an equitable coloring with k colors where k ≥∆+3/2. This bound is tight and confirms a conjecture by Zhang and Wu. We do not use the discharging method but rather exploit decomposition trees of K4-minor-free graphs. © 2017, Brown University. All rights reserved.
引用
收藏
页码:1091 / 1105
页数:14
相关论文