A note on pancyclism of highly connected graphs

详细信息    查看全文

• 作者：Flandrin ; Evelyne ; Li ; Hao ; Marczyk ; Antoni ; Wozniak ; Mariusz
• 关键词：05C38 ; 05C45 ; Hamiltonian graphs ; Pancyclic graphs ; Cycles ; Connectivity ; Stability number
• 刊名：Discrete Mathematics
• 出版年：2004
• 出版时间：September 6, 2004
• 年：2004
• 卷：286
• 期：1-2
• 页码：57-60
• 全文大小：199 K

文摘

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