Claw-free graphs — A survey

1997/02/01 by Ralph J. Faudree, Ralph Faudree, Evelyne Flandrin +1 · 5 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Chordal graph #Claw #Clique-sum #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Interconnection Networks and Systems #Mathematics

paper · doi:10.1016/s0012-365x(96)00045-3

crossref issued 1997/02/01 · crossref published 1997/02/01 · crossref published-print 1997/02/01 · openalex publication_date 1997/02/01 · crossref created 2003/04/23 · crossref deposited 2021/05/09 · openalex created_date 2025/10/10 · crossref indexed 2026/04/28 · openalex updated_date 2026/07/28

Citations

• Tough graphs and hamiltonian circuits
• The monotone circuit complexity of boolean functions
• The binding number of a graph and its Anderson number
• On domination perfect graphs
• Paths, Trees, and Flowers

Cited by

• The k-in-a-Path Problem for Claw-free Graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Characterizations and algorithmic applications of chordal graph embeddings
• Dominating set [wikipedia]
• Interval graph [wikipedia]