A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
From MaRDI portal
Publication:526255
DOI10.1016/J.DISC.2017.03.010zbMATH Open1361.05069OpenAlexW2599794309MaRDI QIDQ526255FDOQ526255
Authors: 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
Recommendations
- A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs
- A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
- Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs
- scientific article; zbMATH DE number 3983207
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Graph theory
- Pancyclic graphs. I
- New sufficient conditions for cycles in graphs
- Characterizing forbidden pairs for hamiltonian properties
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- 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 (2)
This page was built for publication: A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526255)
