%0 Journal Article %1 dyer_complexity_1985 %A Dyer, M.E. %A Frieze, A.M. %D 1985 %J Discrete applied mathematics %K bcp imported %N 2 %P 139--153 %T On the complexity of partitioning graphs into connected subgraphs %V 10

@article{dyer_complexity_1985, added-at = {2009-10-12T12:20:34.000+0200}, author = {Dyer, {M.E.} and Frieze, {A.M.}}, biburl = {https://www.bibsonomy.org/bibtex/297a0695748b3bea42da4d905e167b3aa/cgray}, interhash = {89221c9032b505abc23c316a59fcd6ac}, intrahash = {97a0695748b3bea42da4d905e167b3aa}, journal = {Discrete applied mathematics}, keywords = {bcp imported}, number = 2, pages = {139--153}, timestamp = {2009-10-13T16:22:20.000+0200}, title = {On the complexity of partitioning graphs into connected subgraphs}, volume = 10, year = 1985 }