Minimum order of graphs with given coloring parameters

Gabor Bacso, Piotr Borowiecki, Mihaly Hujter +1

A complete $k$-coloring of a graph $G=(V,E)$ is an assignment $\phi :V\to \{1,\dots ,k\}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the uni…