Some theorems of uniquely pancyclic graphs (Q1073809)

The reviewer in 1973, raised the question of determining uniquely pancyclic graphs (graphs of order n having exactly one cycle of length \(\ell\), \(3\leq \ell \leq n)\). The author determines all such graphs with at most \(n+3\) edges, shows that there is no such graph with \(n+4\) edges and conjectures that none exists with more than \(n+4\) edges. Finally, all outerplanar uniquely graphs are determined.