Flower snark
Infinite family of graphs / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Flower snark?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In the mathematical field of graph theory, the flower snarks form an infinite family of snarks introduced by Rufus Isaacs in 1975.[1]
Quick Facts Vertices, Edges ...
Flower snark | |
---|---|
Vertices | 4n |
Edges | 6n |
Girth | 3 for n=3 5 for n=5 6 for n≥7 |
Chromatic number | 3 |
Chromatic index | 4 |
Book thickness | 3 for n=5 3 for n=7 |
Queue number | 2 for n=5 2 for n=7 |
Properties | Snark for n≥5 |
Notation | Jn with n odd |
Table of graphs and parameters |
Close
Quick Facts Vertices, Edges ...
Flower snark J5 | |
---|---|
Vertices | 20 |
Edges | 30 |
Girth | 5 |
Chromatic number | 3 |
Chromatic index | 4 |
Properties | Snark Hypohamiltonian |
Table of graphs and parameters |
Close
As snarks, the flower snarks are connected, bridgeless cubic graphs with chromatic index equal to 4. The flower snarks are non-planar and non-hamiltonian. The flower snarks J5 and J7 have book thickness 3 and queue number 2.[2]