Results and Problems on Equitable Coloring of Graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917992501084160 |
|---|---|
| author | Kierstead, H. A. Kostochka, Alexandr Xiang, Zimu |
| author_facet | Kierstead, H. A. Kostochka, Alexandr Xiang, Zimu |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_14711 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Results and Problems on Equitable Coloring of Graphs Kierstead, H. A. Kostochka, Alexandr Xiang, Zimu Combinatorics 05C07, 05C15, 05C35 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. |
| title | Results and Problems on Equitable Coloring of Graphs |
| topic | Combinatorics 05C07, 05C15, 05C35 |
| url | https://arxiv.org/abs/2504.14711 |