SnarkSnark
graph theory
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three colors. In order to avoid trivial cases, snarks are often restricted to have additional requirements on their connectivity and on the length of their cycles.
Excerpt from the Wikipedia article “Snark (graph theory)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: No machine-readable author provided. Hakeem.gadi assumed (based on copyright claims)., Public domain, via Wikimedia Commons.
Open free boosters and add Snark to your collection.
Play for free

