On multichromatic numbers of widely colorable graphs

Anna Gujgiczer, Gábor Simonyi

A coloring is called $s$-wide if no walk of length $2s-1$ connects vertices of the same color. A graph is $s$-widely colorable with $t$ colors if and only if it admits a homomorphi…