( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Construction Techniques for Digraphs with Minimum Diameter.

, , , и . IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 327-336. Springer, (2013)

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.

Edy Zahnd

Edy Budiarso

Edy Suprianto

Eckart Edye

Christian Edye

 

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

On Size Multipartite Ramsey Numbers for Stars versus Cycles., , , и . ICGTIS, том 74 из Procedia Computer Science, стр. 27-31. Elsevier, (2015)The Ramsey numbers for disjoint unions of trees., , и . Discret. Math., 306 (24): 3297-3301 (2006)The Ramsey Numbers of Large cycles Versus Odd Wheels., , и . Graphs Comb., 24 (1): 53-58 (2008)On Unicyclic Ramsey (mK2, P3)-Minimal Graphs., , , и . ICGTIS, том 74 из Procedia Computer Science, стр. 10-14. Elsevier, (2015)On Locating-chromatic Number for Graphs with Dominant Vertices., , , и . ICGTIS, том 74 из Procedia Computer Science, стр. 89-92. Elsevier, (2015)Construction Techniques for Digraphs with Minimum Diameter., , , и . IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 327-336. Springer, (2013)An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels., , , и . IJCCGGT, том 3330 из Lecture Notes in Computer Science, стр. 181-184. Springer, (2003)Digraphs of degree 3 and order close to the moore bound., , , и . J. Graph Theory, 20 (3): 339-349 (1995)Characterizing all trees with locating-chromatic number 3., и . Electron. J. Graph Theory Appl., 1 (2): 109-117 (2013)Algorithm to Construct Graph with Total Vertex Irregularity Strength Two., , , , и . ICGTIS, том 74 из Procedia Computer Science, стр. 132-137. Elsevier, (2015)