Clique-heavy subgraphs and pancyclicity of 2-connected graphs

DOI10.1016/J.IPL.2016.08.004zbMATH Open1388.05146OpenAlexW2515072365MaRDI QIDQ318913

Wojciech Wideł

Publication date: 6 October 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.08.004

zbMATH Keywords

combinatorial problemsHamilton cyclepancyclicityclique-heavy subgraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Characterizing forbidden pairs for hamiltonian properties
• Characterizing heavy subgraph pairs for pancyclicity
• Pancyclic graphs. I
• Note on Hamilton Circuits
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

Related Items (1)

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

This page was built for publication: Clique-heavy subgraphs and pancyclicity of 2-connected graphs