Trees in Graphs with Conflict Edges or Forbidden Transitions

@inproceedings{Kant2013TreesIG,
  title={Trees in Graphs with Conflict Edges or Forbidden Transitions},
  author={Mamadou Moustapha Kant{\'e} and Christian Laforest and Benjamin Mom{\`e}ge},
  booktitle={TAMC},
  year={2013}
}
In a recent paper [Paths, trees and matchings under disjunctive constraints, Darmann et. al., Discr. Appl. Math., 2011] the authors add to a graph G a set of conflicts, i.e. pairs of edges of G that cannot be both in a subgraph of G. They proved hardness results on the problem of constructing minimum spanning trees and maximum matchings containing no… CONTINUE READING