The flower snarks, denoted
for , 7, 9, ..., are a family of graphs
discovered by Isaacs (1975) which are snarks. The construction
for flower snarks may be generalized to all (i.e., not just odd) integer . In this work, such graphs are termed flower
graphs.
Clark, L. and Entringer, R. "Smallest Maximally Nonhamiltonian Graphs." Periodica Math. Hungarica14, 57-68, 1983.Holton,
D. A. and Sheehan, J. The
Petersen Graph. Cambridge, England: Cambridge University Press, pp. 82
and 97-100, 1993.Isaacs, R. "Infinite Families of Nontrivial Trivalent
Graphs Which Are Not Tait Colorable." Amer. Math. Monthly82,
221-239, 1975.Scheinerman, E. R. and Ullman, D. H. Fractional
Graph Theory A Rational Approach to the Theory of Graphs. New York: Dover,
2011.West, D. B. Introduction
to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 306,
2000.
for 
, 7, 9, ..., are a family of graphs
discovered by Isaacs (1975) which are snarks. The construction
for flower snarks may be generalized to all (i.e., not just odd) integer 
. In this work, such graphs are termed flower
graphs.
appears in Scheinerman and Ullman
(2011, p. 96) as an example of a graph with edge
chromatic number and fractional
edge chromatic number (4 and 3, respectively) both integers but not equal.
(Clark and Entringer 1983).
"Flower", n
].
