A new sufficient condition for pancyclability of graphs

DOI10.1016/j.dam.2013.08.026zbMath1300.05146OpenAlexW2010125980MaRDI QIDQ741733

Hao Li, Jun-qing Cai

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.026

zbMATH Keywords

cyclable\(S\)-length\(S\)-pancyclable\(S\)-vertex

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Partial degree conditions and cycle coverings in bipartite graphs ⋮ Analyzing lattice networks through substructures ⋮ Vertex-based and edge-based centroids of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A sufficient condition for pancyclability of graphs
• A cycle structure theorem for Hamiltonian graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• An Ore-type condition for pancyclability
• Locally pancyclic graphs
• Cycles through prescribed vertices with large degree sum
• Sequences, claws and cyclability of graphs
• Cycles and Connectivity in Graphs

This page was built for publication: A new sufficient condition for pancyclability of graphs