An Ore-type condition for pancyclability
From MaRDI portal
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.
Recommendations
- An Ore-type condition for cyclability
- An Ore-type condition for the existence of two disjoint cycles
- scientific article; zbMATH DE number 4204378
- On Ore-type sufficient condition for a bipancyclic ordering
- A note on a new condition implying pancyclism
- A sufficient condition for pancyclability of graphs
- An implicit degree Ore-condition for pancyclicity of graphs
- A Chvátal--Erdős type condition for pancyclability
- A sufficient condition for pancyclic graphs
- A sufficient condition for pancyclic graphs
Cited in
(11)- A look at cycles containing specified elements of a graph
- On Ore-type sufficient condition for a bipancyclic ordering
- Locally pancyclic graphs
- A degree characterisation of pancyclicity
- Cycles through given vertices and closures
- Recent advances on the Hamiltonian problem: survey III
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Cyclability and pancyclability in bipartite graphs
- A new sufficient condition for pancyclability of graphs
- A sufficient condition for pancyclability of graphs
This page was built for publication: An Ore-type condition for pancyclability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304817)
