Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs

DOI10.1016/J.DISC.2019.111644zbMATH Open1429.05116OpenAlexW2971924794MaRDI QIDQ2279291FDOQ2279291

Authors: Wei Zheng, Ligong Wang, Hajo Broersma, Shenggui Zhang 

Publication date: 12 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111644

Recommendations

• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• Mengerian properties, hamiltonicity, and claw‐free graphs
• scientific article; zbMATH DE number 1782860
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs

zbMATH Keywords

dominating setclaw-freeimplicit claw-heavyHamiltonian property

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph theory with applications
• Implicit-degrees and circumferences
• An implicit degree condition for cyclability in graphs
• Hamilton cycles in implicit claw-heavy graphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
• Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
• Dominating set and Hamiltonicity in claw-heavy graphs.

Cited In (4)

• Title not available (Why is that?)
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• The Clique Number and Some Hamiltonian Properties of Graphs
• Degree conditions for k‐ordered hamiltonian graphs

This page was built for publication: Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs

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