
arXiv: 2311.14915
For every $r\ge13$, we show every 1-planar graph $G$ with $Δ(G)\le r$ has an equitable $r$-coloring.
9 figures
Coloring of graphs and hypergraphs, 05C15, equitable coloring conjecture, Hajnal-Szemerédi, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 1-planar, digraph, Planar graphs; geometric and topological aspects of graph theory
Coloring of graphs and hypergraphs, 05C15, equitable coloring conjecture, Hajnal-Szemerédi, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 1-planar, digraph, Planar graphs; geometric and topological aspects of graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
