Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria

E.S. Mahmoodian, Behnaz Omoomi, and Nasrin Soltankhah, Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria, 78: 211-223, 2006.