5 citations · 9 across the 11 of their papers we have counts for
1 paper · 1 filter
Isaak H. Wolf
For two graphs G and H, a mapping f:E(G)→E(H) is an H-coloring of G, if it is a proper edge-coloring and for every v∈V(G) there exists a vertex $u \in V(H…