4 sonucu aktar:
Yazar Başlık Tür [ Yıl(Desc)]
Süzgeçler: Yazar: Mordechai Shalom  [Clear All Filters]
2016
"Graphs of edge-intersecting and non-splitting paths", Theoretical Computer Science, vol. 629, pp. 40-50, 2016.
2017
Boyacı, A., T. Ekim, and M. Shalom, "A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs", Information Processing Letters, vol. 121, pp. 29-33, 2017.
"On two extensions of equimatchable graphs", Discrete Optimization, vol. 26, pp. 112-130, 2017.
2018
Akbari, S., H. Alizadeh, T. Ekim, D. Gözüpek, and M. Shalom, "Equimatchable claw-free graphs", Discrete Mathematics, vol. 341, pp. 2859-2871, 2018.