Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n = 5, 7, 9, ... to all integer n>=5. They are illustrated above for n = 5 to 9. Flower graphs are unit-distance. Precomputed properties of flower graphs are implemented in a future version of the Wolfram Language as GraphData[{Flower, n}]. Different graphs are sometimes termed flower graphs by various authors.