An Ore-type condition for pancyclability

DOI10.1016/S0012-365X(98)00399-9MaRDI QIDQ1304817zbMATH OpenOpenAlexWikidataFDO

Authors Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian

Publication date 11 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00399-9

zbMATH Keywords

pancycliccyclable

Mathematics Subject Classification ID

Paths and cycles (05C38)

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

(10)

• Locally pancyclic graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Recent advances on the Hamiltonian problem: survey III
• Cycles through given vertices and closures
• A look at cycles containing specified elements of a graph
• A new sufficient condition for pancyclability of graphs
• Cyclability and pancyclability in bipartite graphs
• A sufficient condition for pancyclability of graphs
• On Ore-type sufficient condition for a bipancyclic ordering
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

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)