Pages that link to "Item:Q1106856"
From MaRDI portal
The following pages link to The number of maximal independent sets in a connected graph (Q1106856):
Displayed 16 items.
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- The maximum number of maximal independent sets in unicyclic connected graphs (Q932626) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- On graphs with the third largest number of maximal independent sets (Q976086) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Graphs with the second largest number of maximal independent sets (Q998481) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- The maximum clique problem (Q1318271) (← links)
- Maximal independent sets in graphs with at most one cycle (Q1372731) (← links)
- Efficient domination of the orientations of a graph (Q1377863) (← links)
- Graphs, partitions and Fibonacci numbers (Q2370416) (← links)
- The number of maximal independent sets of \((k+1)\)-valent trees (Q2504102) (← links)
- A finiteness theorem for maximal independent sets (Q2563420) (← links)
- Constraints on the number of maximal independent sets in graphs (Q4284106) (← links)
- (Q5708515) (← links)