Clique-heavy subgraphs and pancyclicity of 2-connected graphs

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

Authors: 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

Recommendations

• A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
• Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
• A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs
• A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
• Characterizing heavy subgraph pairs for pancyclicity
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
• Heavy cycles in 2-connected triangle-free weighted graphs
• On connectivity in graphs with given clique number

zbMATH Keywords

Hamilton cyclecombinatorial problemspancyclicityclique-heavy subgraph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• A triple of heavy subgraphs ensuring 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
• Characterizing heavy subgraph pairs for pancyclicity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q318913)