Nešetřil, Jaroslav, 1946-
Nešetřil, Jaroslav.
Nešetřil, Jaroslav, 1946-...., Mathématicien
Jaroslav Nešetřil český matematik, vysokoškolský pedagog a výtvarník
VIAF ID: 73984691 ( Personal )
Permalink: http://viaf.org/viaf/73984691
Preferred Forms
- 100 0 _ ‡a Jaroslav Nešetřil ‡c český matematik, vysokoškolský pedagog a výtvarník
- 100 1 _ ‡a Nesetřil, Jaroslav ‡d 1946-...
-
-
- 100 1 _ ‡a Nešetřil, Jaroslav
-
-
- 100 1 _ ‡a Nešetřil, Jaroslav ‡d 1946-
-
- 100 1 _ ‡a Nešetřil, Jaroslav, ‡d 1946-...., ‡c Mathématicien
- 100 1 _ ‡a Nešetřil, Jaroslav
-
-
-
-
- 100 1 _ ‡a Nešetřil, Jaroslav ‡d 1946-
-
- 100 1 _ ‡a Nešetřil, Jaroslav, ‡d 1946-
-
4xx's: Alternate Name Forms (25)
5xx's: Related Names (2)
- 510 2 _ ‡a Univerzita Karlova
- 510 2 _ ‡a Univerzita Karlova ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Algorithms - ESA '99 : 7th annual European symposium, Prague, Czech Republic, July 16-18, 1999 : proceedings | |
Combinatorial Aspects of Davenport-Schinzel Sequences | |
Combinatorial number theory proceedings of the "Integers Conference 2011", Carrollton, Georgia, October 26 - 29, 2011 | |
Computer science review. | |
core of a graph | |
Diskrete Mathematik eine Entdeckungsreise | |
Divers aspects de la coloration de graphes. | |
Either tournaments or algebras? | |
The Erdös-Turán property for a class of bases | |
ESA'99 | |
Extendability, dimensions, and diagrams of cyclic orders | |
Fast and slow growing (a combinatorial study of unprovability) | |
Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity | |
Geometry, structure and randomness in combinatorics | |
Grafy | |
Graphs and homomorphisms | |
Graphs with small asymmetries | |
Images of rigid digraphs | |
Integers | |
Invitation to discrete mathematics | |
Jan Pelant - in memoriam | |
...Just posters... | |
Kapitoly z diskrétní matematiky | |
Kombinatorika. | |
Many aspects of graph coloring | |
Matematický čert : kniha pod polštář pro všechny, kteří mají strach z matematiky | |
mathematics of Paul Erdös | |
Minimal graphs without bilateral symmetry the case of induced length 4 | |
n80066355 | |
Načeradský, Nešetřil : antropogeometrie | |
Number theory and combinatorics a collection in honor of the mathematics of Ronald Graham | |
On a problem of Pisier | |
On bounded treewidth duality of graphs | |
On ordered graphs and graph orderings | |
On polynomial time didicability of induced minor closed classes | |
On reconstructing of infinite forests | |
On symmetric and antisymmetric relations | |
On the computational complexity of Seidel's switching | |
Partitions of subgraphs | |
Physics and theoretical computer science from numbers and languages to (quantum) cryptography security | |
Planar subgraphs of topological layouts | |
Proměny místa a prostoru | |
Qui a tué le duc de Densmore? | |
A Ramsey graph without triangles exists for any graph without triangles | |
The Ramsey property for graphs with forbidden complete subgraphs | |
Ramsey theory | |
Ramseyova teorie pro systémy | |
Reorientations of covering graphs | |
Risan sūgaku eno shōtai. | |
Rozklad struktur : [Autoreferát kand. dis.] | |
The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 | |
Simple tournaments and sharply transitive groups | |
Sparsity Graphs, Structures, and Algorithms | |
Sparsity, (Springer) | |
Stíny souvislostí : (tvarosloví) = Shadows of coherence : (a vocabulary) : Jiří Načeradský, Jaroslav Nešetřil, Stanislav Tůma | |
Tension continuous maps—their structure and applications | |
Teorie grafů, 1979: | |
Topological, algebraical, and combinatorial structures : Frolík's memorial volume | |
Topology and poetics of space | |
Transformations of the place and space | |
A unified approach to structural limits and limits of graphs with bounded tree-depth | |
Universality of directed graphs of a given height | |
Unprovability of set union problem strategies | |
Vysoké funkce | |
Zahlenteufel. | |
離散数学への招待. |