A note on pancyclism of highly connected graphs
By applying Ramsey's theorem, the authors prove the pancyclicity of every graph with sufficiently large connectivity with respect to the stability number of the graph.
scientific article; zbMATH DE number 2105610