A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
From MaRDI portal
Publication:521765
DOI10.7151/DMGT.1938zbMATH Open1359.05066OpenAlexW2556912289MaRDI QIDQ521765FDOQ521765
Authors: Wojciech Wide 
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
Recommendations
- A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs
- A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs
- Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
- Characterizing heavy subgraph pairs for pancyclicity
Cites Work
- Pancyclic graphs. I
- Graph theory with applications
- Degree-light-free graphs and Hamiltonian cycles
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
- Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
- 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
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- Title not available (Why is that?)
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
Cited In (4)
This page was built for publication: A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521765)
