Degree sum conditions for traceable quasi-claw-free graphs

DOI10.3770/J.ISSN:2095-2651.2022.02.003MaRDI QIDQ5081907zbMATH OpenFDO

Authors Shuaijun Chen, Xiaodong Chen, Mingchu Li

Publication date 17 June 2022

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2022.02.003

zbMATH Keywords

degree sumquasi-claw-free graphstraceable graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38)

Recommendations

• On sufficient degree conditions for traceability of claw-free graphs
• Non-traceability of large connected claw-free graphs
• scientific article; zbMATH DE number 1208720
• On traceability of claw-\({o_{-1}}\)-heavy graphs
• scientific article; zbMATH DE number 554191

Cites work

• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
• Graph theory with applications
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Quasi-claw-free graphs

Cited in

(9)

• On sufficient degree conditions for traceability of claw-free graphs
• On traceability of claw-\({o_{-1}}\)-heavy graphs
• scientific article; zbMATH DE number 1208720 (Why is no real title available?)
• scientific article; zbMATH DE number 554191 (Why is no real title available?)
• Non-traceability of large connected claw-free graphs
• Degree sums of adjacent vertices for traceability of claw-free graphs
• Spectral radius and traceability of connected claw-free graphs
• A note on degree conditions for traceability in locally claw-free graphs
• Minimum path cover in quasi-claw-free graphs

This page was built for publication: Degree sum conditions for traceable quasi-claw-free graphs

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