%0 Journal Article %1 journals/ejgta/U16 %A U, Sung Sik %D 2016 %J Electron. J. Graph Theory Appl. %K dblp %N 2 %P 171-177 %T Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition. %U http://dblp.uni-trier.de/db/journals/ejgta/ejgta4.html#U16 %V 4

@article{journals/ejgta/U16, added-at = {2020-07-03T00:00:00.000+0200}, author = {U, Sung Sik}, biburl = {https://www.bibsonomy.org/bibtex/23ec87aba3ece764c31553551c1888ab9/dblp}, ee = {https://doi.org/10.5614/ejgta.2016.4.2.5}, interhash = {d18c4c77647ff31ee28c469c7c82dd13}, intrahash = {3ec87aba3ece764c31553551c1888ab9}, journal = {Electron. J. Graph Theory Appl.}, keywords = {dblp}, number = 2, pages = {171-177}, timestamp = {2020-07-04T11:53:57.000+0200}, title = {Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition.}, url = {http://dblp.uni-trier.de/db/journals/ejgta/ejgta4.html#U16}, volume = 4, year = 2016 }