Cube this problem, and in 1837 Pierre Wantzel proved it to be impossible because the cube root of 2 is not a constructible number. The cube has three uniform colorings, named by the colors of the square faces around each vertex: 111, 112, 123. The cube has three classes of symmetry, which can be represented by vertex-transitive coloring the faces. The highest octahedral symmetry O has all the faces the same color. The dihedral symmetry D comes from the cube being a prism, with all four sides being the same color. The lowest symmetry D is also a prismatic symmetry, with
Partial cube root vertex "r" for the tree, arbitrarily, and label each vertex "v" with a string of "m" bits that has a 1 in position "i" whenever edge "i" lies on the path from "r" to "v" in "T". For instance, "r" itself will have a label that is all zero bits, its neighbors will have labels with a single 1-bit, etc. Then the Hamming distance between any two labels is the distance between the two vertices in the tree, so this labeling shows that "T" is a partial cube. Every hypercube graph is itself a partial cube, which can be