[1] BERRACHEDI A.-HAVEL I.-MULDER H. M.: Spherical and clockwise spherical graphs. Report 9456/B, Erasmus University Rotterdam, 1994.

[2] COCKAYNE E. J.-HEDETNIEMI S. T.: Towards a theory of domination in graphs. Networks 7 (1977), 247-271. MR 0483788

[3] DVOŘÁK T.-HAVEL I.-LABORDE, J-M.-LIEBL P.: Generalized hypercubes and graph embedding with dilation. Rostocker Mathem. Kolloquium 39 (1990), 13-20. MR 1090602 | Zbl 0719.05036

[4] HARARY F.: Four difficult unsolved problems in graph theory. In: Recent Advances in Graph Theory (M. Fiedler, ed.), Academia, Praha, 1974, pp. 249-256. MR 0382042

[5] LABORDE, J-M.: Sur le Nombre Domatique du n-Cube et Une Conjecture de Zelinka. European J. Combin. 8 (1987), 175-177. MR 0896130 | Zbl 0641.05026

[6] MOLLARD M.: Les invariants du n-cube. These de 3e cycle, IMAG, Grenoble, 1981.

[7] MULDER H. M.: The interval function of a graph. Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980. MR 0605838 | Zbl 0446.05039

[8] PAYAN, CH.: On the chromatic number of cube-like graphs. Discrete Math. 103 (1992), 271-277. MR 1171780 | Zbl 0772.05043

[9] SLOANE N. J. A.-Mac-WILLIAMS F. J.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1978.

[10] SOKOLOVÁ M.: The chromatic number of extended odd graphs is four. Časopis Pěst. Mat. 112 (1987), 308-311. MR 0905977 | Zbl 0667.05023

[11] ZELINKA B.: Domatically critical graphs. Czechoslovak Math. J. 30 (1980), 468-489. MR 0583627 | Zbl 0426.05046

[12] ZELINKA B.: Domatic numbers of cube graphs. Math. Slovaca 32 (1982), 117-119. MR 0658244 | Zbl 0487.05057