×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [ng p r gk r]
Home >
ng p r gk r
Counting Proper Colors Given k N and a graph G, the value (G;k) is the number of proper colorings f: V(G) [k], where the k colors need not all be.
215 views