[1][2][3][4][5][6][7] The Dejter graph is obtained by deleting a copy of the Hamming code of length 7 from the binary 7-cube.

In fact, it is proven that the Dejter graph can be 2-colored, say in the color set {red, blue}, as in the top figure to the right, so that both the resulting edge-monochromatic red and blue vertex-spanning subgraphs are copies of the Ljubljana graph.

This is suggested in each of the two representations of the Ljubljana graph, (red above, blue below, both to the right), by alternately coloring the inverse images of successive vertices of the Heawood graph, say in black and white (better viewed by twice clicking on images for figure enlargements), according to the Heawood graph bipartition.

Each such inverse image is formed by the 8 neighbors, along a fixed coordinate direction of the 7-cube, of the half of the Hamming code having a fixed weight, 0 or 1.

By exchanging these weights via the permutation (0 1), one can pass from the adjacency offered by the red Ljubljana graph to the one offered by the blue Ljubljana graph, or vice versa.