Maximal independent sets in graphs with at most one cycle

DOI10.1016/S0166-218X(97)00033-4zbMath0883.05076MaRDI QIDQ1372731

Min-Jen Jou, Gerard Jennhwa Chang

Publication date: 23 February 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (15)

On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets ⋮ The second largest number of maximal independent sets in connected graphs with at most one cycle ⋮ The maximum number of maximal independent sets in unicyclic connected graphs ⋮ Independent sets in graphs ⋮ On graphs with the third largest number of maximal independent sets ⋮ Trees with a given number of leaves and the maximal number of maximum independent sets ⋮ On the third largest number of maximal independent sets of graphs ⋮ Satisfiability of mixed Horn formulas ⋮ Graphs with the second largest number of maximal independent sets ⋮ Trees without twin-leaves with smallest number of maximal independent sets ⋮ The number of independent sets in unicyclic graphs with a given diameter ⋮ Maximal independent sets in caterpillar graphs ⋮ The number of maximal independent sets in connected triangle-free graphs ⋮ Trees with the second largest number of maximal independent sets ⋮ The number of independent sets in unicyclic 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
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs

This page was built for publication: Maximal independent sets in graphs with at most one cycle