Hamiltonian connected claw-free graphs

DOI10.1007/S00373-004-0559-6MaRDI QIDQ704830zbMATH OpenOpenAlexFDO

Authors Mingchu Li

Publication date 20 January 2005

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0559-6

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On Hamiltonian claw-free graphs
• scientific article; zbMATH DE number 1347015
• scientific article; zbMATH DE number 1381050
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonian cycles in \(2\)-connected claw-free graphs

Cited in

(15)

• On 1-Hamilton-connected claw-free graphs
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• On Hamiltonian claw-free graphs
• Recent advances on the Hamiltonian problem: survey III
• scientific article; zbMATH DE number 1293866 (Why is no real title available?)
• On hamiltonian‐connected graphs
• Hamiltonicity in claw-free graphs
• Closure and Hamilton-connected claw-free hourglass-free graphs
• Minimal 2-connected non-Hamiltonian claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs \(P_4\) and \(K_1\) in claw-free graphs
• Hamilton-connected claw-free graphs with Ore-degree conditions
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Hamiltonian claw-free graphs involving minimum degrees
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs

This page was built for publication: Hamiltonian connected claw-free graphs

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