SNARK

Snark

In the mathematical field of graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by only three colors without two edges of the same color meeting at a point. In order to avoid trivial cases, snarks are often restricted to have girth at least 5.

The above text is a snippet from Wikipedia: Snark (graph theory)
and as such is available under the Creative Commons Attribution/Share-Alike License.

snark

Noun

  1. Snide remarks.

Noun (etymology 2)

  1. A graph in which every node has three branches, and the edges cannot be coloured in fewer than four colours without two edges of the same colour meeting at a point.
  2. A fluke or unrepeatable result or detection in an experiment.
    Cabrera's Valentine's Day monopole detection or some extremely energetic cosmic rays could be examples of snarks.

Verb

  1. To express oneself in a snarky fashion
  2. To snort.


The above text is a snippet from Wiktionary: snark
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!