( en | de | ru )

 

Disambiguation of "Kühn, Daniela"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Hamilton cycles in robustly expanding digraphs.

, , , and . J. Graph Algorithms Appl., 16 (2): 335-358 (2012)

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.

Daniela Kühn

Daniela Kühn

Daniela Kerstin Kühn

Daniela Kuhn

Daniel Kühn

Mikrosatelliteninstabilitäten und Defekte in den Spindelcheckpointgenen Bub1b und MAD2 als mögliche prädiktive Marker für das Prostatakarzinom. Uni Würzburg, (2009)
 

Other publications of authors with the same name

Complete Minors In Ks, s-Free Graphs., and . Combinatorica, 25 (1): 49-64 (2004)Optimal path and cycle decompositions of dense quasirandom graphs., , and . Electron. Notes Discret. Math., (2015)Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree., , and . Comb. Probab. Comput., 22 (3): 394-416 (2013)Minimalist designs., , , , , and . Random Struct. Algorithms, 57 (1): 47-63 (2020)Matchings in hypergraphs of large minimum degree., and . J. Graph Theory, 51 (4): 269-280 (2006)Ramsey numbers of sparse hypergraphs., , , and . Electron. Notes Discret. Math., (2007)Fractional and integer matchings in uniform hypergraphs., , and . Eur. J. Comb., (2014)Minors in graphs of large girth., and . Random Struct. Algorithms, 22 (2): 213-225 (2003)Graph minor hierarchies., and . Discret. Appl. Math., 145 (2): 167-182 (2005)The order of the largest complete minor in a random graph., , and . Random Struct. Algorithms, 33 (2): 127-141 (2008)