A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs

DOI10.7151/DMGT.1938MaRDI QIDQ521765zbMATH OpenOpenAlexFDO

Authors Wojciech Wide

Publication date 12 April 2017

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1938

zbMATH Keywords

cycleHamilton cyclepancyclicityFan-type heavy subgraph

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 842880 (Why is no real title available?)
• 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
• Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
• Degree-light-free graphs and Hamiltonian cycles
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
• Graph theory with applications
• Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
• Pancyclic graphs. I
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs

Cited in

(4)

• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• Clique-heavy subgraphs and pancyclicity of 2-connected graphs
• A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
• A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs

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)