Some theorems of uniquely pancyclic graphs

@article{Shi1986SomeTO,
  title={Some theorems of uniquely pancyclic graphs},
  author={Yongbing Shi},
  journal={Discrete Mathematics},
  year={1986},
  volume={59},
  pages={167-180}
}
In this paper we discuss an unsolved problem in [1]: Determine which simple graph G has exactly one cycle of each length l, 3 ~< l ~< v (where v is the number of the vertices of G). We call a graph with this property a uniquely pancyclic graph (UPC-graph). We solve this problem under the condition: G is an outerplanar graph. We determine all UPC-graphs each of which contains v + m edges for m ~< 3. We also conjecture that none of the graphs, each of which contains v + m edges for m/> 4, is a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

A note on uniquely pancyclic graphs

Australasian J. Combinatorics • 2009
View 3 Excerpts
Highly Influenced

(2)-pancyclic Graphs

Discrete Applied Mathematics • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…