A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs

DOI10.7151/dmgt.1840zbMath1329.05167OpenAlexW2562091529MaRDI QIDQ907840

Wojciech Wideł

Publication date: 26 January 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1840

zbMATH Keywords

cycleHamilton cyclepancyclicityFan-type heavy subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs ⋮ A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs ⋮ Fan's condition on induced subgraphs for circumference and pancyclicity

Cites Work

• Unnamed Item
• Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
• Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
• A cycle structure theorem for Hamiltonian graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Pancyclic graphs. I
• Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs

This page was built for publication: A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs