( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Shrub-depth: Capturing Height of Dense Graphs.

, , , , и . CoRR, (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.

Jaroslav Chlup

Jaroslav Mach

Jaroslav Suchomel

Jaroslav Pleva

Jaroslav Rindoš

 

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

Shrub-depth: Capturing Height of Dense Graphs., , , , и . CoRR, (2017)Posets, Boolean Representations and Quick Path Searching., , и . ICALP, том 267 из Lecture Notes in Computer Science, стр. 404-424. Springer, (1987)Postorder Hierarchy for Path Compressions and Set Union., и . IMYCS, том 381 из Lecture Notes in Computer Science, стр. 146-151. Springer, (1988)Partitions of Graphs into Cographs., и . Electron. Notes Discret. Math., (2002)Ramsey theorem for designs., и . Electron. Notes Discret. Math., (2017)A note on Random Homomorphism from ArbitraryGraphs to Z., , и . Electron. Notes Discret. Math., (2001)NP for Combinatorialists., и . Electron. Notes Discret. Math., (2007)Graph-indexed random walks on pseudotrees., и . Electron. Notes Discret. Math., (2018)Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number., и . Comb. Probab. Comput., 8 (5): 467-472 (1999)Extendability, Dimensions, and Diagrams of Cycle Orders., , и . SIAM J. Discret. Math., 4 (4): 453-471 (1991)