A simple graph is called regular if every vertex of this gra

A simple graph is called regular if every vertex of this graph has the same degree. A regular graph is called n-regular if every vertex in this graph has degree n. Recall that Kn is the complete graphs with n vertices. And Kn is the complete bipartite graph (see the definition in the book). Is Kn regular What is the chromatic number of K For which values of m and n graph Kmn is regular What is the chromatic number of Kmt How many vertices does a 4-regular graph with 10 edges have

Solution