A note on uniquely pancyclic graphs
2009 (English)In: The Australasian Journal of Combinatorics, ISSN 1034-4942, Vol. 44, 105-110 p.Article in journal (Refereed) Published
In this paper we consider uniquely pancyclic graphs, ie 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.
Place, publisher, year, edition, pages
2009. Vol. 44, 105-110 p.
Research subject Mathematical Statistics
IdentifiersURN: urn:nbn:se:umu:diva-31671OAI: oai:DiVA.org:umu-31671DiVA: diva2:293855