A graph \(G\) is called quasi-claw-free if it satisfies that, for each pair \((x,y)\) of vertices \(x\) and \(y\) of \(G\) with \(d(x,y) = 2\), there is a vertex \(u \in N(x) \cap N(y)\) such that \(N(u) \subseteq N(x) \cup N(y)\). It is obvious that every claw-free (\(K_{1,3}\)-free) graph is quasi-claw-free, but, not vice versa. In this paper, a few known results for claw-free graphs are generalized for quasi-claw-free graphs.
Recommendations
Cites work
- 2‐neighborhoods and hamiltonian conditions
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- A note on Hamiltonian circuits
- Almost claw‐free graphs
- An improvement of fraisse's sufficient condition for hamiltonian graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Extending cycles in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Graphs with 1-Factors
- Hamilton cycles in claw-free graphs
- scientific article; zbMATH DE number 4177109 (Why is no real title available?)
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 3412692 (Why is no real title available?)
- New sufficient conditions for cycles in graphs
- Pancyclicity and extendability in strong products
- Quasi-claw-free graphs
- The Factorization of Linear Graphs
- Toughness and hamiltonicity in almost claw-free graphs
Cited in
(31)- Vertex pancyclicity in quasi-claw-free graphs
- On hamiltonicity of \(P_{3}\)-dominated graphs
- On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
- Claw-free graphs---a survey
- Quasi-claw-free graphs
- Global insertion and Hamiltonicity in DCT-graphs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Distance-dominating cycles in quasi claw-free graphs
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Hamiltonicity of 3-connected quasi-claw-free graphs.
- Claw-free graphs. VII. Quasi-line graphs
- Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- Spanning k-ended trees in quasi-claw-free graphs
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Claw-free strictly Deza graphs
- Hamilton connectedness and the partially square graphs
- On the circumference of 3-connected quasi-claw-free graphs
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- scientific article; zbMATH DE number 5371683 (Why is no real title available?)
- scientific article; zbMATH DE number 5525657 (Why is no real title available?)
- Minimal claw-free graphs
- On 3-connected Hamiltonian line graphs
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
- Graphs with equal domination and independent domination numbers
- Degree sum conditions for traceable quasi-claw-free graphs
- Minimum path cover in quasi-claw-free graphs
- Vertex pancyclicity in quasi claw-free graphs
This page was built for publication: Quasi-claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377703)
