Nesetril, Jaroslav

1. Classes of graphs with low complexity: the case of classes with bounded\n linear rankwidth
   2019/09/04 by Jaroslav Nešetřil, Nesetril, Jaroslav, Patrice Ossona de Mendez +5 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Limits and Structures in Graph Theory
2. Linear rankwidth meets stability
   2019/11/15 by Nesetril, Jaroslav, de Mendez, Patrice Ossona, Rabinovich, Roman +1 · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)
3. Modeling Limits in Hereditary Classes: Reduction and Application to Trees
   2013/12/02 by Jaroslav Nešetřil, Patrice Ossona de Mendez, Nesetril, Jaroslav +1 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications