Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs

Fábio Protti, Uéverton S. Souza. Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. Discrete Mathematics & Theoretical Computer Science, 20(2), 2018. [doi]

@article{ProttiS18,
  title = {Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs},
  author = {Fábio Protti and Uéverton S. Souza},
  year = {2018},
  url = {http://dmtcs.episciences.org/4979},
  researchr = {https://researchr.org/publication/ProttiS18},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  volume = {20},
  number = {2},
}