Increasing the minimum degree of a graph by contractions. Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos, D. M. Theor. Comput. Sci., 481:74-84, 2013.
Increasing the minimum degree of a graph by contractions. [link]Link  Increasing the minimum degree of a graph by contractions. [link]Paper  bibtex   
@article{journals/tcs/GolovachKPT13,
  added-at = {2013-04-18T00:00:00.000+0200},
  author = {Golovach, Petr A. and Kaminski, Marcin and Paulusma, Daniël and Thilikos, Dimitrios M.},
  biburl = {http://www.bibsonomy.org/bibtex/248377508a32231172f91002adb58bffe/dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2013.02.030},
  interhash = {1107c0d76d356c25c7df6aa9e5cec7f6},
  intrahash = {48377508a32231172f91002adb58bffe},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {74-84},
  timestamp = {2013-08-13T12:55:20.000+0200},
  title = {Increasing the minimum degree of a graph by contractions.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs481.html#GolovachKPT13},
  volume = 481,
  year = 2013
}

Downloads: 0