List 3-coloring of C4-free diameter-2 graphs is solvable in polynomial time using a structural characterization of non-3-colorable instances.
Faster 3-colouring algorithm for graphs of diameter 3
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that given an $n$-vertex graph $G$ of diameter 3 we can decide if $G$ is $3$-colourable in time $2^{O(n^{2/3-\varepsilon})}$ for any $\varepsilon < 1/33$. This improves on the previous best algorithm of $2^{O((n\log n)^{2/3})}$ from D\k{e}bski, Piecyk and Rz\k{a}\.zewski [Faster 3-coloring of small-diameter graphs, ESA 2021].
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
List $3$-coloring $C_4$-free graphs of diameter-$2$ in polynomial-time
List 3-coloring of C4-free diameter-2 graphs is solvable in polynomial time using a structural characterization of non-3-colorable instances.