A note on pancyclism of highly connected graphs (Q1883250)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on pancyclism of highly connected graphs |
scientific article |
Statements
A note on pancyclism of highly connected graphs (English)
0 references
1 October 2004
0 references
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.
0 references
Hamiltonian graphs
0 references
pancyclic graphs
0 references
connectivity
0 references
stability number
0 references
