Scholarlink

A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themselves. In this paper, we discuss the state of art and unsolved problems on equitable coloring and its list versions.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Results and Problems on Equitable Coloring of Graphs

  • 章节

  • 发表日期：

    2026年

查看全文
  • H. A. Kierstead,
  • Alexandr Kostochka,
  • Zimu Xiang

摘要

A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themselves. In this paper, we discuss the state of art and unsolved problems on equitable coloring and its list versions.