Efficient improvement of lower bounds in equitable coloring

Yu ZHANG , Jing CHEN , Jiwei JIN , Feifei MA

Front. Comput. Sci. ›› 2026, Vol. 20 ›› Issue (11) : 2011409

PDF (157KB)
Front. Comput. Sci. ›› 2026, Vol. 20 ›› Issue (11) : 2011409 DOI: 10.1007/s11704-025-50183-9
Theoretical Computer Science
LETTER

Efficient improvement of lower bounds in equitable coloring

Author information +
History +
PDF (157KB)

Cite this article

Download citation ▾
Yu ZHANG, Jing CHEN, Jiwei JIN, Feifei MA. Efficient improvement of lower bounds in equitable coloring. Front. Comput. Sci., 2026, 20(11): 2011409 DOI:10.1007/s11704-025-50183-9

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

Olariu E F, Frăsinaru C . Improving lower bounds for equitable chromatic number. Computers & Operations Research, 2022, 143: 105790

[2]

Díaz I M, Nasini G, Severín D. A tabu search heuristic for the equitable coloring problem. In: Proceedings of the 3rd International Symposium on Combinatorial Optimization. 2014, 347–358

RIGHTS & PERMISSIONS

Higher Education Press

AI Summary AI Mindmap
PDF (157KB)

117

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/