( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Spanning embeddings of arrangeable graphs with sublinear bandwidth.

, , и . Random Struct. Algorithms, 48 (2): 270-289 (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.

Julia Böttcher

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Guenter Julian

Otto Julian

Ernst Julian

 

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

An Approximate Version of the Tree Packing Conjecture via Random Embeddings., , , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 490-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Cycle factors in randomly perturbed graphs., , , и . LAGOS, том 195 из Procedia Computer Science, стр. 404-411. Elsevier, (2021)Spanning embeddings of arrangeable graphs with sublinear bandwidth., , и . Random Struct. Algorithms, 48 (2): 270-289 (2016)Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time.. MFCS, том 3618 из Lecture Notes in Computer Science, стр. 156-167. Springer, (2005)Ramsey Properties of Permutations., и . Electron. J. Comb., 20 (1): 2 (2013)Properly coloured copies and rainbow copies of large graphs with small maximum degree., , и . Random Struct. Algorithms, 40 (4): 425-436 (2012)Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles., , , , и . Eur. J. Comb., (2024)Large-scale structures in random graphs.. BCC, стр. 87-140. Cambridge University Press, (2017)On the bandwidth conjecture for 3-colourable graphs., , и . SODA, стр. 618-626. SIAM, (2007)Spanning 3-colourable subgraphs of small bandwidth in dense graphs., , и . J. Comb. Theory B, 98 (4): 752-777 (2008)