( en | de | ru )

 

Disambiguation of "Nesetril, Jaroslav"

Author of the publication

copydeleteadd this publication to your clipboard
On universal graphs for planar oriented graphs of a given girth.

, , , , and . Discret. Math., 188 (1-3): 73-85 (1998)

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.

Jaroslav Chlup

Jaroslav Mach

Jaroslav Suchomel

Jaroslav Pleva

Jaroslav Vaclavsky

 

Other publications of authors with the same name

Shrub-depth: Capturing Height of Dense Graphs., , , , and . CoRR, (2017)Bowtie-free graphs have a Ramsey lift., and . Adv. Appl. Math., (2018)A note on Random Homomorphism from ArbitraryGraphs to Z., , and . Electron. Notes Discret. Math., (2001)Graph-indexed random walks on pseudotrees., and . Electron. Notes Discret. Math., (2018)NP for Combinatorialists., and . Electron. Notes Discret. Math., (2007)Ramsey theorem for designs., and . Electron. Notes Discret. Math., (2017)Partitions of Graphs into Cographs., and . Electron. Notes Discret. Math., (2002)Postorder Hierarchy for Path Compressions and Set Union., and . IMYCS, volume 381 of Lecture Notes in Computer Science, page 146-151. Springer, (1988)Posets, Boolean Representations and Quick Path Searching., , and . ICALP, volume 267 of Lecture Notes in Computer Science, page 404-424. Springer, (1987)Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number., and . Comb. Probab. Comput., 8 (5): 467-472 (1999)