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
Gear Cube between. - Place those two edges on the top side and complete the following algorithm: (U2 R4) 2. Step 2: Repeat the previous step until all edge pieces are in the correct position (edge colors match the colors of the sides it is between). Phase 3: Orient the edges: (second algorithm used) Step 1: Rotate all sides until the cube is back in a cubic state using the following algorithm: R4 (repeat as necessary). There are multiple variations of the Gear Cube, ranging from the most simple, a 2x2 Gear Shift, to the most complicated, the 3x3 Even Less Gears