A p-centered coloring of a graph G, where p is a positive integer, is a
...
A k-linear coloring of a graph G is an edge coloring of G with k
colors ...
A graph is k-clique-extendible if there is an ordering of the vertices s...
The eternal vertex cover problem is a variant of the classical vertex co...
share