Quasi-claw-free graphs

DOI10.1016/S0012-365X(97)00023-XzbMath0888.05038MaRDI QIDQ1377703

Ahmed Ainouche

Publication date: 13 May 1998

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

zbMATH Keywords

quasi-claw-free graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonicity of 3-connected quasi-claw-free graphs., Claw-free graphs---a survey, Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter, Quasi-claw-free graphs, Vertex pancyclicity in quasi claw-free graphs, On 3-connected Hamiltonian line graphs, A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs, Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs, Hamiltonicity of claw-free graphs and Fan-type conditions, Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs, Perfect matchings and \(K_{1,p}\)-restricted graphs, Unnamed Item, Hamilton connectedness and the partially square graphs, On the circumference of 3-connected quasi-claw-free graphs, 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, Spanning \(k\)-ended trees in quasi-claw-free graphs, Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers, Hamiltonicity of 2-connected quasi-claw-free graphs, Minimum path cover in quasi-claw-free graphs, Global insertion and Hamiltonicity in DCT-graphs, Graphs with equal domination and independent domination numbers, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending cycles in graphs
• New sufficient conditions for cycles in graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Quasi-claw-free graphs
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• A note on Hamiltonian circuits
• Hamilton cycles in claw-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• 2‐neighborhoods and hamiltonian conditions
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Graphs with 1-Factors
• Almost claw‐free graphs
• Pancyclicity and extendability in strong products
• Toughness and hamiltonicity in almost claw-free graphs
• The Factorization of Linear Graphs