In graph theory, a snark is an undirected graph with exactly three edges per vertices. Snarks are often restricted to have additional requirements on their connectivity and on the length of their cycles. Infinitely many snarks are known to exist.