( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Counting and packing Hamilton cycles in dense graphs and oriented graphs.

, , и . J. Comb. Theory B, (2017)

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.

Benny Hartono

Benny Sebastian

Benny Dobbriner

Benny Bürger

Benny Pock

 

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

How many random edges make a dense hypergraph non-2-colorable?, и . Random Struct. Algorithms, 32 (3): 290-306 (2008)On smoothed analysis in dense graphs and formulas., , и . Random Struct. Algorithms, 29 (2): 180-193 (2006)Sperner's Theorem and a Problem of Erdős, Katona and Kleitman., , и . Comb. Probab. Comput., 24 (4): 585-608 (2015)Getting a Directed Hamilton Cycle Two Times Faster., , и . Comb. Probab. Comput., 21 (5): 773-801 (2012)Local Density In Graphs With Forbidden Subgraphs., и . Comb. Probab. Comput., 12 (2): 139-153 (2003)Musical Chairs., , , , , и . SIAM J. Discret. Math., 28 (3): 1578-1600 (2014)Ramsey Numbers and the Size of Graphs.. SIAM J. Discret. Math., 21 (4): 980-986 (2007)A Random Triadic Process., , и . SIAM J. Discret. Math., 30 (1): 1-19 (2016)The Strong Chromatic Index of Random Graphs., , и . SIAM J. Discret. Math., 19 (3): 719-727 (2005)Edge-disjoint rainbow trees in properly coloured complete graphs., и . Electron. Notes Discret. Math., (2017)