%0 Journal Article %1 journals/rsa/BohmanFM03 %A Bohman, Tom %A Frieze, Alan M. %A Martin, Ryan R. %D 2003 %J Random Struct. Algorithms %K dblp %N 1 %P 33-42 %T How many random edges make a dense graph hamiltonian? %U http://dblp.uni-trier.de/db/journals/rsa/rsa22.html#BohmanFM03 %V 22

@article{journals/rsa/BohmanFM03, added-at = {2016-10-11T00:00:00.000+0200}, author = {Bohman, Tom and Frieze, Alan M. and Martin, Ryan R.}, biburl = {https://www.bibsonomy.org/bibtex/2819686ae7d943fcccb06153e5b555e15/dblp}, ee = {http://dx.doi.org/10.1002/rsa.10070}, interhash = {eef5e6df4589a4cf44e5a874eb860ae9}, intrahash = {819686ae7d943fcccb06153e5b555e15}, journal = {Random Struct. Algorithms}, keywords = {dblp}, number = 1, pages = {33-42}, timestamp = {2016-10-12T11:33:30.000+0200}, title = {How many random edges make a dense graph hamiltonian?}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa22.html#BohmanFM03}, volume = 22, year = 2003 }