This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.
A stronger bound for the strong chromatic index
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We prove $\chi_s'(G)\leq 1.93 \Delta(G)^2$ for graphs of sufficiently large maximum degree where $\chi_s'(G)$ is the strong chromatic index of $G$. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where it is allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2022 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.