Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids

@article{Levit2007TrianglefreeGW,
  title={Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids},
  author={Vadim E. Levit and Eugen Mandrescu},
  journal={Discrete Applied Mathematics},
  year={2007},
  volume={155},
  pages={2414-2425}
}
A matching M is uniquely restricted in a graph G if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself [M.C. Golumbic, T. Hirst, M. Lewenstein, Uniquely restricted matchings, Algorithmica 31 (2001) 139–154]. G is a König–Egerváry graph provided (G) + (G) = |V (G)| [R.W. Deming, Independence numbers of graphs—an extension of the König–Egerváry theorem, Discrete Math. 27 (1979) 23–33; F. Sterboul, A characterization of the graphs in which the transversal… CONTINUE READING