List 3-coloring of C4-free diameter-2 graphs is solvable in polynomial time using a structural characterization of non-3-colorable instances.
Vertex colouring and forbidden subgraphs–a survey.Graphs and Combinatorics, 20(1):1–40, 2004
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.