( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Equimatchable Graphs are C_2k+1-free for k ≥ 4.

, , , и . CTW, стр. 125-128. (2015)

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.

Maria Ekimova

Arkadij Ekimov

Ali Tinazli

 

Другие публикации лиц с тем же именем

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 364-374. Springer, (2008)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , и . SEA², том 11544 из Lecture Notes in Computer Science, стр. 21-34. Springer, (2019)Partitioning cographs into cliques and stable sets., , и . Discret. Optim., 2 (2): 145-153 (2005)Construction of balanced sports schedules using partitions into subleagues., , и . Oper. Res. Lett., 36 (3): 279-282 (2008)On the minimum and maximum selective graph coloring problems in some graph classes., , и . Discret. Appl. Math., (2016)Erratum., и . J. Comb. Optim., 11 (1): 125 (2006)Graphs of edge-intersecting and non-splitting paths., , , и . ICTCS, том 1231 из CEUR Workshop Proceedings, стр. 45-58. CEUR-WS.org, (2014)Linear-Time Generation of Random Chordal Graphs., , , и . CIAC, том 10236 из Lecture Notes in Computer Science, стр. 442-453. (2017)Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem., , и . SEA, том 265 из LIPIcs, стр. 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Efficient recognition of equimatchable graphs., и . Inf. Process. Lett., 114 (1-2): 66-71 (2014)