Abstract A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each ...
In 1997, I had a vision that I drew out in a flash that would change my life. It depicted the evolution of complexity that started with energy and grew into the dimensions of matter, life, mind, and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback