2 sonucu aktar:
Yazar Başlık Tür [ Yıl] Süzgeçler: First Letter Of Last Name: D and Yazar is Dibek, Cemil [Clear All Filters]
"On matching extendability of lexicographic products",
RAIRO-Oper. Res., vol. 51, pp. 857-873, 2017.
"Equimatchable graphs are C2k+ 1-free for k≥ 4",
Discrete Mathematics, vol. 339, pp. 2964–2969, 2016.