Abstract
For every r≥13, we show every 1-planar graph G with Δ(G)≤r has an equitable r-coloring.
Original language | English (US) |
---|---|
Article number | 114286 |
Journal | Discrete Mathematics |
Volume | 348 |
Issue number | 2 |
DOIs | |
State | Published - Feb 2025 |
Keywords
- 1-planar
- Digraph
- Equitable coloring conjecture
- Hajnal-Szemerédi
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics