List 3-coloring of C4-free diameter-2 graphs is solvable in polynomial time using a structural characterization of non-3-colorable instances.
On moore graphs with diameters 2 and 3.IBM Journal of Research and Development, 4(5):497–504, 1960
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.