( en | de | ru )

 

Disambiguation of "Ekim, Tínaz"

Author of the publication

copydeleteadd this publication to your clipboard
Equimatchable graphs are C2k+1-free for k≥4.

, , , and . Discret. Math., 339 (12): 2964-2969 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maria Ekimova

Arkadij Ekimov

Ali Tinazli

 

Other publications of authors with the same name

On Three Extensions of Equimatchable Graphs., , , , and . Electron. Notes Discret. Math., (2016)Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 364-374. Springer, (2008)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 21-34. Springer, (2019)Generation of random chordal graphs using subtrees of a tree., , , and . RAIRO Oper. Res., 56 (2): 565-582 (2022)Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II., , , and . Discret. Math. Theor. Comput. Sci., (2018)Split-critical and uniquely split-colorable graphs., , and . Discret. Math. Theor. Comput. Sci., 12 (5): 1-24 (2010)Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem., , and . INFORMS J. Comput., 30 (1): 43-56 (2018)Integer programming formulations for the minimum weighted maximal matching problem., and . Optim. Lett., 6 (6): 1161-1171 (2012)A tutorial on the use of graph coloring for some problems in robotics., , and . Eur. J. Oper. Res., 192 (1): 41-55 (2009)An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs., , and . Eur. J. Oper. Res., 291 (1): 67-83 (2021)