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 8 up edges that show the same two colors. Once this is done, turning only the outer layers of the cube allows it to be solved like a 3×3×3 cube. However, certain positions that cannot be solved on a standard 3×3×3 cube may be reached. For instance, a single sextet of edges may be inverted, or the cube may appear to have an odd permutation (that is, two pieces must be swapped, which is not possible on the 3×3×3 cube). These situations are known as parity errors, and require special algorithms to be solved. Another similar approach to solving this cube