Let $G$ be a graph and $M\subseteq V(G)$ be a maximal independent set. Is there a coloring $c:V(G)\to\chi(G)$ such that $c$ is constant on $M$?


(The answer is positive for graphs with infinite chromatic number: Given any coloring $c:V(G)\to\chi(G)$ define a new coloring $c'$ by $c(m) = 0$ for $m\in M$ and $c'(x) = c(x)+1$ for $x\in $V(G)\setminus M$.)



Coloring maximal independent sets with 1 color
Pick some bipartite graph A,B and add a huge new independent set of vertices connecting half of them with all of A and half of them with all of B. The resulting graph is bipartite, but there is no 2-coloring of it which is constant on the new set.


