Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
From MaRDI portal
Publication:2630334
DOI10.1016/j.ipl.2016.06.012zbMath1362.05079OpenAlexW2472945617MaRDI QIDQ2630334
Publication date: 27 July 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.06.012
Related Items (4)
Degree sum conditions on two disjoint cycles in graphs ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs ⋮ Spanning trees with a bounded number of leaves
Cites Work
- Unnamed Item
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Hamilton cycles in implicit claw-heavy graphs
- New sufficient conditions for cycles in graphs
- Implicit-degrees and circumferences
- Hamilton cycles in claw-heavy graphs
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Degree conditions on claws and modified claws for Hamiltonicity of graphs
- An Implicit Degree Condition for Cyclability in Graphs
- Note on Hamilton Circuits
This page was built for publication: Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs