On edge-transitive cubic graphs of square-free order

A regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive. In this paper, we give a complete list of connected semisymmetric cubic graph of square-free order, which consists of one single graph of order 210 and four infinite families of such graphs.