Bidiakis cube Bidiakis cube In the mathematical field of graph theory, the Bidiakis cube is a 3-regular graph with 12 vertices and 18 edges. The Bidiakis cube is a cubic Hamiltonian graph and can be defined by the LCF notation [-6,4,-4]. The Bidiakis cube can also be constructed from a cube by adding edges across the top and bottom faces which connect the centres of opposite sides of the faces. The two additional edges need to be perpendicular to each other. With this construction, the Bidiakis cube is a polyhedral graph, and can be realized as a convex polyhedron. Therefore, by Steinitz's
V-Cube 6 to first pair the edges, and then the centers. This, too, is vulnerable to the parity errors described above. Other methods solve the cube by solving a cross and the centers, but not solving any of the edges and corners not needed for the cross, then the other edges would be placed similar to the 3x3x3 Fridrich method. Some methods are designed to avoid the parity errors described above. For instance, solving the corners and edges first and the centers last would avoid such parity errors. Once the rest of the cube is solved, any permutation of the center pieces