Title of article
A note on pancyclism of highly connected graphs Original Research Article
Author/Authors
Evelyne Flandrin، نويسنده , , Hao Li، نويسنده , , Antoni Marczyk، نويسنده , , Mariusz Wo?niak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
4
From page
57
To page
60
Abstract
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).
Keywords
Stability number , Hamiltonian graphs , Pancyclic graphs , Cycles , Connectivity
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
949027
Link To Document