论文信息 - A note on pancyclism of highly connected graphs

A note on pancyclism of highly connected graphs

Jackson and Ordaz conjectured that if the stability number @a(G) of a graph G is no greater than its connectivity @k(G) then G is pancyclic. Applying Ramsey's theorem we prove the pancyclicity of every graph G with @k(G) sufficiently large with respect to @a(G).

Hao Li | Mariusz Wozniak | Evelyne Flandrin | Antoni Marczyk

[1] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .

[2] D. Sotteau,et al. Chvátal-Erdös Theorem For Digraphs , 1990 .

[3] Paul Erdös,et al. A note on Hamiltonian circuits , 1972, Discret. Math..

[4] Bill Jackson,et al. Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey , 1990, Discret. Math..

[5] J. Bondy,et al. Pancyclic graphs II , 1971 .

[6] Wayne Goddard,et al. Weakly pancyclic graphs , 1998, J. Graph Theory.

[7] Dingjun Lou. The Chvátal-Erdös condition for cycles in triangle-free graphs , 1996, Discret. Math..

[8] Denise Amar,et al. Pancyclism in Chvátal-Erdös's graphs , 1991, Graphs Comb..