( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How many F's are there in G?

, и . Eur. J. Comb., 32 (7): 1126-1141 (2011)

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 Mach

Jaroslav Suchomel

Jaroslav Chlup

Jaroslav Vaclavsky

Jaroslav Pleva

 

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

A unified approach to structural limits, and limits of graphs with bounded tree-depth, и . (2013)cite arxiv:1303.6471.Density and Fractal Property of the Class of Oriented Trees., , и . CoRR, (2019)Homomorphisms and Polynomial Invariants of Graphs., , и . Electron. Notes Discret. Math., (2007)Preface: Volume 10., , и . Electron. Notes Discret. Math., (2001)Z. Frolík and his winter schools.. Discret. Math., 108 (1-3): 1-2 (1992)Representations of Graphs by Means of Products and Their Complexity.. MFCS, том 118 из Lecture Notes in Computer Science, стр. 94-102. Springer, (1981)Spectra, graphs, and proteins. Towards understanding of protein folding., , и . Contemporary Trends in Discrete Mathematics, том 49 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 237-255. DIMACS/AMS, (1997)Art of Graph Drawing and Art.. J. Graph Algorithms Appl., 6 (1): 131-147 (2002)Grad and classes with bounded expansion I. Decompositions., и . Eur. J. Comb., 29 (3): 760-776 (2008)Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms., и . Eur. J. Comb., 31 (8): 1981-1995 (2010)