81 citations · 134 across the 18 of their papers we have counts for
1 paper · 1 filter
Radu Curticapean
Given graphs H and G, possibly with vertex-colors, a homomorphism is a function f:V(H)→V(G) that preserves colors and edges. Many interesting counting problems (e.g., subg…