Classification of edge-transitive rose window graphs
Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set and edge set . In this article a complete classification of edge-transitive rose window graphs is given, thus solving one of the three open problems about these graphs posed by Steve Wilson in 2001.  2010 Wiley Periodicals, Inc. J Graph Theory 65: 216231, 2010
edge-transitive rose window graph group vertex-transitive arc-transitive