An Ore-type condition for pancyclability
type: Item
instance of: scholarly article
title: An Ore-type condition for pancyclability
zbMATH Open document ID: 0929.05045
DOI: 10.1016/S0012-365X(98)00399-9
author: Odile Favaron
author: Evelyne Flandrin
author: Hao Li
author: Feng Tian
published in: Discrete Mathematics
publication date: 2000-01-11T00:00:00Z
review text: Let \(G\) be a graph of order \(n\) and \(S\) a subset of \(V(G)\). \(G\) is said to be \(S\)-pancyclable if for every integer \(l\) with \(3 \leq l \leq | S| \), there exists a cycle in \(G\) that contains exactly \(l\) vertices of \(S\). It is proved that if the degree sum in \(G\) is at least \(n\), then \(G\) is either \(S\)-pancyclable or else \(n\) is even, \(S = V(G)\) and \(G = K_{{n/2},{n/2}}\), or \(| S| = 4\), \(G[S] = K_{2,2}\) and the structure of \(G\) is well characterized.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1340371
zbMATH Keywords: pancyclic
zbMATH Keywords: cyclable
reviewed by: Stanislav Jendroľ
MaRDI profile type: Publication
Wikidata QID: Q127488962
full work available at URL: s0012-365x(98)00399-9
OpenAlex ID: W2071360549
Recommended article: An Ore-type condition for cyclability
Recommended article: An Ore-type condition for the existence of two disjoint cycles
Recommended article: Q3353047
Recommended article: On Ore-type sufficient condition for a bipancyclic ordering
Recommended article: A note on a new condition implying pancyclism
Recommended article: A sufficient condition for pancyclability of graphs
Recommended article: An implicit degree Ore-condition for pancyclicity of graphs
Recommended article: A Chvátal--Erdős type condition for pancyclability
Recommended article: A sufficient condition for pancyclic graphs
description: scientific article; zbMATH DE number 1340371