A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
A note on uniquely pancyclic graphs
2009
The Australasian Journal of Combinatorics
Preserved Fulltext
In this paper we consider uniquely pancyclic graphs, i.e. n vertex graphs with exactly one cycle of each length from 3 to n. The first result of the paper gives new upper and lower bounds on the number of edges in a uniquely pancyclic graph. Next we report on a computer search for new uniquely pancyclic graphs. We found that there are no new such graphs on n ≤ 59 vertices and that there are no uniquely pancyclic graphs with exactly 5 chords.
dblp:journals/ajc/Markstrom09
fatcat:tjliqd4ofne4zbiiwdsh42wntm