Results and Problems on Equitable Coloring of Graphs

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.

Publication Details

Journal
ArXiv.org
Published
2025-04-20
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Results and Problems on Equitable Coloring of Graphs

ArXiv.org
Advanced Graph Theory Research
article

Results and Problems on Equitable Coloring of Graphs

article en

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.

ArXiv.org
Openalex Percentile: Top 47%
Advanced Graph Theory Research
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Results and Problems on Equitable Coloring of Graphs · ArXiv.org (2025) | TGRS Research Map | TGRS