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

DOI10.1016/j.disc.2017.03.010zbMath1361.05069OpenAlexW2599794309MaRDI QIDQ526255

Wojciech Wideł

Publication date: 10 May 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.010

zbMATH Keywords

Hamilton cyclepancyclicityFan-type heavy subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• 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
• Characterizing forbidden pairs for hamiltonian properties
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
• 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 triple of subgraphs for pancyclicity of 2-connected graphs