Let be the hypercube graph.

- (the complete graph with two vertices),
- (the square), and
- is constructed taking two copies of and adding an edge that connects each vertex of the first copy with the corresponding vertex of the second copy.

Easy: Find (chromatic number) for every .

Harder: Find every such that is planar.