1 paper
Yusaku Nishimura
Let G be an undirected graph of order n and let Ci be an i-cycle graph. G is called pancyclic if G contains a Ci for any i∈{3,4,…,n}. We show that the p…