Snark (graph theory)

In graph theory, a **snark** is a specific type of graph that has some interesting properties. Snarks are defined as: 1. **Cubic Graphs**: Snarks are always cubic, meaning every vertex in the graph has a degree of 3. 2. **Not 3-Colorable**: A characteristic feature of snarks is that they cannot be colored with 3 colors without having two adjacent vertices sharing the same color.