6 sonucu aktar:
Yazar Başlık Tür [ Yıl] Süzgeçler: Yazar: Ekim, Tinaz and First Letter Of Title is M [Clear All Filters]
"Mind the independence gap",
Discrete Mathematics, vol. 343, pp. 111943, 2020.
"The maximum cardinality cut problem in co-bipartite chain graphs",
Journal of Combinatorial Optimization, vol. 35, pp. 250–265, Jan, 2018.
"On matching extendability of lexicographic products",
RAIRO-Oper. Res., vol. 51, pp. 857-873, 2017.
"Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded",
Discrete Mathematics, vol. 340, pp. 927 - 934, 2017.
"On the minimum and maximum selective graph coloring problems in some graph classes",
Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
"Minimum maximal matching is NP-hard in regular bipartite graphs",
Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.