0
$\begingroup$

Is there a graph $G$ such that $\chi(G)$ is finite, but there is no total coloring with finitely many colours?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
2
$\begingroup$

Yes there is: consider the complete bipartite graph $K_{\omega,\omega}$, which has chromatic number 2, but every total coloring requires infinitely many colors.

Improve this answer
$\endgroup$

You must log in to answer this question.