2 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Mirko Horňák
A vertex colouring f:V(G)→C of a graph G is complete if for any c1,c2∈C with c1=c2 there are in G adjacent vertices v1,v2 such that f(v1)=c1 and $f(v…