Hamiltonicity of 2-connected quasi-claw-free graphs

DOI10.1016/J.DISC.2003.12.007MaRDI QIDQ1827784zbMATH OpenOpenAlexFDO

Authors Rao Li

Publication date 6 August 2004

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Claw-free graphsHamiltonicityQuasi-claw-free graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Review text

The author calls a graph quasi-claw-free if, for any two vertices \(x,y\) of distance \(2\), there exists a common neighbor \(u\) of \(x,y\) such that each neighbor of \(u\) (distinct from \(x,y\)) is also a neighbor of either \(x\) or \(y\) (or both). He then proves that a quasi-claw-free graph with \(n\) vertices and minimum degree at least \(n/4\) is Hamiltonian unless it belongs to a restricted (completely specified) class of graphs.

Recommendations

• Hamiltonicity of 3-connected quasi-claw-free graphs.
• A neighborhood condition for quasi claw-free Hamiltonian graphs
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• On the circumference of 3-connected quasi-claw-free graphs

Cites work

• Graph theory with applications
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• On maximal paths and circuits of graphs
• Quasi-claw-free graphs

Cited in

(19)

• Vertex pancyclicity in quasi-claw-free graphs
• On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
• Minimal 2-connected non-Hamiltonian claw-free graphs
• Hamiltonicity of 3-connected quasi-claw-free graphs.
• Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs
• On the circumference of 3-connected quasi-claw-free graphs
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• scientific article; zbMATH DE number 5914958 (Why is no real title available?)
• A neighborhood condition for quasi claw-free Hamiltonian graphs
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• scientific article; zbMATH DE number 5631247 (Why is no real title available?)
• scientific article; zbMATH DE number 1247721 (Why is no real title available?)
• scientific article; zbMATH DE number 1961507 (Why is no real title available?)
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
• Degree sum conditions for traceable quasi-claw-free graphs
• The matching number and Hamiitonicity of quasi-claw-free graphs
• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• Quadrangularly connected claw-free graphs

This page was built for publication: Hamiltonicity of 2-connected quasi-claw-free graphs

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