Year: 2025
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6979378500
Cites:
Cited by:
Related to: