Coloring a hypercube graph

Revision en1, by f2lk6wf90d, 2017-06-26 17:28:34

When is it possible to color the vertices of a hypercube graph Qk with k colors, such that for every vertex v, the colors of its adjacent vertices are pairwise distinct?
Example for Q2: We can color any two adjacent vertices with the same color, and color the other two vertices with another color. Then for every vertex, its neighbors will be colored differently.


  Rev. Lang. By When Δ Comment
en1 English f2lk6wf90d 2017-06-26 17:28:34 403 Initial revision (published)