Some new results on Sylvester colorings of cubic graphs

Luca Ferrarini, Vahan Mkrtchyan

If $G$ and $H$ are two cubic multi-graphs, then an $H$-coloring of $G$ is a mapping $f:E(G)\to E(H)$, such that for every $v\in V(G)$ there is a vertex $x\in V(H)$, such t…