A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
From MaRDI portal
Publication:521765
DOI10.7151/dmgt.1938zbMath1359.05066OpenAlexW2556912289MaRDI QIDQ521765
Publication date: 12 April 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1938
Cites Work
- Unnamed Item
- Unnamed Item
- Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
- 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
- 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
- Degree-light-free graphs and Hamiltonian cycles
This page was built for publication: A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs