What is the smallest number of colors that can be used to color the vertices of a cube so that no 2…
Two colors suffice because the cube graph is bipartite. Assign one color to vertices whose three binary coordinates have even sum and the other to vertices whose coordinates…
Choose your answer
What is the smallest number of colors that can be used to color the vertices of a cube so that no 2 adjacent vertices are colored identically?
Answer and explanation
Correct answer A
Two colors suffice because the cube graph is bipartite. Assign one color to vertices whose three binary coordinates have even sum and the other to vertices whose coordinates have odd sum; every edge joins opposite classes. One color cannot suffice because adjacent vertices must differ.
Practice for these exams
-
Maharashtra and Goa SET (MH SET)