The Parameterized Complexity of Graph Cyclability. Golovach, P. A., Kaminski, M., Maniatis, S., & Thilikos, D. M. SIAM J. Discrete Math., 31(1):511-541, 2017.
The Parameterized Complexity of Graph Cyclability. [link]Link  The Parameterized Complexity of Graph Cyclability. [link]Paper  bibtex   
@article{journals/siamdm/GolovachKMT17,
  added-at = {2017-05-03T00:00:00.000+0200},
  author = {Golovach, Petr A. and Kaminski, Marcin and Maniatis, Spyridon and Thilikos, Dimitrios M.},
  biburl = {http://www.bibsonomy.org/bibtex/2ec3384d2719030867e5a6749ded31956/dblp},
  ee = {https://doi.org/10.1137/141000014},
  interhash = {f85310ad8a004e931820374920679abb},
  intrahash = {ec3384d2719030867e5a6749ded31956},
  journal = {SIAM J. Discrete Math.},
  keywords = {dblp},
  number = 1,
  pages = {511-541},
  timestamp = {2017-05-04T11:37:58.000+0200},
  title = {The Parameterized Complexity of Graph Cyclability.},
  url = {http://dblp.uni-trier.de/db/journals/siamdm/siamdm31.html#GolovachKMT17},
  volume = 31,
  year = 2017
}

Downloads: 0