For Better Performance Please Use Chrome or Firefox Web Browser

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.

Journal Papers
Month/Season: 
January
Year: 
2006
File: 
PDF icon smallest_defining_number_of_r-regular_k-chromatic_graphs.pdf

تحت نظارت وف ایرانی

Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria | Dr. Behnaz Omoomi

Error

The website encountered an unexpected error. Please try again later.

تحت نظارت وف ایرانی