An inequality of graph coloring

98 Views Asked by At

Let $G_1=(V,E_1)$ and $G_2=(V,E_2)$ be two graphs with the same vertices. Define a new graph $G=(V,E_1 \cup E_2)$. Prove that $$χ(G)\leqslant χ(G_1)χ(G_2),$$ when $χ(G)$ is the coloring number of $G$.

I would appreciate any help! Thanks.