On the minimum vertex cover of snarks

Gustavo Fernandes, Atílio G. Luiz

A vertex cover of a graph $G$ is a subset of vertices $C\subseteq V(G)$ such that every edge of $G$ is incident to at least one vertex in $C$. The vertex cover number of $G$ is th…