A Fan-type heavy pair od subgraphs for pancyclicity of 2-connected graphs
Wojciech Wideł · Discussiones Mathematicae Graph Theory · 2015
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f 1 -heavy, if for every induced subgraph K of G isomorphic to H and every two vertices