Triangles in claw-free graphs

DOI10.1016/S0012-365X(97)00237-9zbMath0958.05079OpenAlexW1976453667MaRDI QIDQ1584304

Hong Wang

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00237-9

zbMATH Keywords

cyclesclaw-free graphtriangles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

Disjoint cliques in claw-free graphs ⋮ Disjoint triangles and quadrilaterals in a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of independent cycles in a graph
• Independent cycles with limited size in a graph
• On the maximum number of independent cycles in a bipartite graph
• Hamiltonian results inK1,3-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• Graphs with 1-Factors
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• On the maximal number of independent circuits in a graph

This page was built for publication: Triangles in claw-free graphs