In the mathematical field of graph theory, the flower snarks form an infinite family of snarks introduced by Rufus Isaacs in 1975.

The flower snarks J5 and J7 have book thickness 3 and queue number 2.

[2] The flower snark Jn can be constructed with the following process : By construction, the Flower snark Jn is a cubic graph with 4n vertices and 6n edges.

[4] J3 is a trivial variation of the Petersen graph formed by replacing one of its vertices by a triangle.

[5] In order to avoid trivial cases, snarks are generally restricted to have girth at least 5.