A note on pancyclism of highly connected graphs
type: Item
instance of: scholarly article
title: A note on pancyclism of highly connected graphs
zbMATH Open document ID: 1050.05073
author: Evelyne Flandrin
author: Hao Li
author: Antoni Marczyk
author: Mariusz Woźniak
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 2105610
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: pancyclic graphs
zbMATH Keywords: connectivity
zbMATH Keywords: stability number
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.045
OpenAlex ID: W1964405806
cites work: Pancyclism in Chvátal-Erdős' graphs
cites work: Pancyclic graphs. I
cites work: Q4401977
cites work: Weakly pancyclic graphs
cites work: Q3487369
cites work: A note on Hamiltonian circuits
cites work: Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
cites work: The Chvátal-Erdös condition for cycles in triangle-free graphs
DOI: 10.1016/J.DISC.2003.11.045
description: scientific article; zbMATH DE number 2105610