1 problem

0 votes0 replies1 view
Goddard–Wash–Xu's two-color conjecture for $K_3$ -WORM-colorable graphs
Let $G$ be a graph that admits a $K_3$ -WORM coloring, meaning a vertex coloring in which every copy of $K_3$ receives at least two colors. The $K_3$ -WORM lower chromatic number…
Conjecturerefutedchromatic-spectrum graph-coloring worm-coloringsarXiv posted 3 days ago

Goddard–Wash–Xu's two-color conjecture for K3K_3K3​-WORM-colorable graphs