Some theorems of uniquely pancyclic graphs
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(13)- (2)-pancyclic graphs
- Unipancyclic matroids
- On the size of graphs without repeated cycle lengths
- scientific article; zbMATH DE number 4019100 (Why is no real title available?)
- Uniquely bipancyclic graphs
- The enumeration of uniquely pancyclic digraph with the least arcs
- A note on uniquely pancyclic graphs
- scientific article; zbMATH DE number 3987317 (Why is no real title available?)
- scientific article; zbMATH DE number 147643 (Why is no real title available?)
- scientific article; zbMATH DE number 165562 (Why is no real title available?)
- scientific article; zbMATH DE number 568835 (Why is no real title available?)
- A class of almost uniquely pancyclic graphs
- Matroids
This page was built for publication: Some theorems of uniquely pancyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073809)