On maximal independent sets of vertices in claw-free graphs

1980/06/01 by George J. Minty, George J Minty · 5 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Graph #Graph power #Graph theory and applications #Independent set #Line graph #Mathematics #Neighbourhood (mathematics) #Path graph #Vertex (graph theory) #Wheel graph

paper · pdf · doi:10.1016/0095-8956(80)90074-x

crossref issued 1980/06/01 · crossref published 1980/06/01 · crossref published-print 1980/06/01 · openalex publication_date 1980/06/01 · crossref created 2005/02/09 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/07/16 · openalex updated_date 2026/07/31

Citations

• A Characterization of Comparability Graphs and of Interval Graphs
• Paths, Trees, and Flowers

Cited by

• Dominoes
• Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Classes of perfect graphs
• Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
• Independent set (graph theory) [wikipedia]