Hamilton-connected claw-free graphs with small parameters

DOI10.1016/J.DAM.2025.07.051MaRDI QIDQ6885599zbMATH OpenFDO

Authors Liming Xiong, Lu Wang

Publication date 11 December 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.07.051

zbMATH Keywords

\(SM\)-closureclaw-free graphHamilton-connected graphhourglass-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites work

• A closure for 1-Hamilton-connectedness in claw-free graphs
• A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• scientific article; zbMATH DE number 6890310 (Why is no real title available?)
• On a closure concept in claw-free graphs
• Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs

This page was built for publication: Hamilton-connected claw-free graphs with small parameters

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