|
|
|
|
References
|
|
| |
| 1. |
Dainyak A.B., Sapozhenko A.A., “Independent sets in graphs”, Discrete Math. Appl., 26:6 (2016), 323–346       |
| 2. |
Frendrup A., Pedersen A., Sapozhenko A., Vestergaard P., “Merrifield–Simmons index and minimum number of independent sets in short trees”, Ars Combinatoria, 111 (2013), 85–95 |
| 3. |
Griggs J., Grinstead C., Guichard D., “The number of maximal independent sets in a connected graph”, Discrete Mathematics, 68:2–3 (1988), 211–220 |
| 4. |
Hujter M., Tuza Z., “The number of maximal independent sets in triangle-free graphs”, SIAM J. Discr. Math., 6:2 (1993), 284–288 |
| 5. |
Jou M., Chang G., “Maximal independent sets in graphs with at most one cycle”, Discr. Appl. Math., 79:1–3 (1997), 67–73 |
| 6. |
Liu J., “Maximal independent sets in bipartite graphs”, J. Graph Theory, 17:1 (1993), 495–507 |
| 7. |
Moon J., Moser L., “On cliques in graphs”, Israel J. Math., 3:1 (1965), 23–28 |
| 8. |
Wilf H., “The number of maximal independent sets in a tree”, SIAM J. Algebr. Discr. Meth., 7:1 (1986), 125–130 |
