"Equimatchable graphs are C2k+ 1-free for k≥ 4",
Discrete Mathematics, vol. 339, pp. 2964–2969, 2016.
"Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I",
Discrete Applied Mathematics, vol. 215, pp. 47–60, 2016.