A finiteness theorem for maximal independent sets

DOI10.1007/BF01858464zbMath0863.05044MaRDI QIDQ2563420

Min-Jen Jou, Chiang Lin, Tze-Heng Ma, Gerard Jennhwa Chang

Publication date: 12 December 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

maximal independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

Trees with maximum number of maximal matchings ⋮ Independent sets in graphs ⋮ Graphs with the second largest number of maximal independent sets ⋮ Maximal independent sets in caterpillar graphs ⋮ The number of maximal independent sets in connected triangle-free graphs

Cites Work

• The number of maximal independent sets in a connected graph
• Maximal independent sets in bipartite graphs
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• On maximal independent sets of nodes in trees
• The structure and maximum number of maximum independent sets in trees
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs

This page was built for publication: A finiteness theorem for maximal independent sets