Fan's condition on induced subgraphs for circumference and pancyclicity

DOI10.7494/OpMath.2017.37.4.617zbMath1397.05088OpenAlexW2607561501MaRDI QIDQ4690991

Wojciech Wideł

Publication date: 23 October 2018

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2017.37.4.617

zbMATH Keywords

Hamiltonian cyclecircumferencepancyclicityFan's condition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• New sufficient conditions for cycles in graphs
• A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs
• A cycle structure theorem for Hamiltonian graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Another cycle structure theorem for Hamiltonian graphs
• Characterizing forbidden pairs for hamiltonian properties
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Sufficient conditions for a graph to be Hamiltonian
• Pancyclic graphs. I
• Large cycles in graphs
• Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
• Degree-light-free graphs and Hamiltonian cycles

This page was built for publication: Fan's condition on induced subgraphs for circumference and pancyclicity