%0 Journal Article %1 journals/dm/Linek89 %A Linek, V. %D 1989 %J Discret. Math. %K dblp %N 2 %P 131-136 %T Bipartite graphs can have any number of independent sets. %U http://dblp.uni-trier.de/db/journals/dm/dm76.html#Linek89 %V 76

@article{journals/dm/Linek89, added-at = {2021-02-12T00:00:00.000+0100}, author = {Linek, V.}, biburl = {https://www.bibsonomy.org/bibtex/28658043c239c5c690a415234325477c2/dblp}, ee = {https://doi.org/10.1016/0012-365X(89)90306-3}, interhash = {82c100c8b149354a4955a1601dc19dde}, intrahash = {8658043c239c5c690a415234325477c2}, journal = {Discret. Math.}, keywords = {dblp}, number = 2, pages = {131-136}, timestamp = {2024-04-09T03:48:04.000+0200}, title = {Bipartite graphs can have any number of independent sets.}, url = {http://dblp.uni-trier.de/db/journals/dm/dm76.html#Linek89}, volume = 76, year = 1989 }