List of Publications

2016
  1. Limits of Mappings [PDF file]
    (L. Hosseini, J. Nesetril, P. Ossona de Mendez) arXiv:1602.07147v1 (2016)
2015
  1. Highlights of Logic, Games, and Automata 2015 [PDF file]
    (Jan Obdržálek (eds.), Andrew Goodall, Antonín Kučera, Helena Nešetřilová, Jaroslav Nešetřil, Petra Milštainová, Tomáš Brázdil) ITI Series (2015), no. 2015-629
  2. Invariant measures via inverse limits of finite structures [PDF file]
    (Cameron Freer, Jaroslav Nešetřil, Nathanael Ackerman, Rehana Patel) ITI Series (2015), no. 2015-624
  3. Ramsey classes with forbidden homomorphisms and a closure [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2015), no. 2015-626
  4. Validation of common typical time of disease duration for HCC patients using the Fisher information processing of tumor imaging results combined with network phenotyping strategy quantification of individual patient clinical profile patterns [PDF file]
    (Brian I. Carr, Jaroslav Nešetřil, Lubomír Skála, Petr Pančoška) ITI Series (2015), no. 2015-627
  5. A Distributed Low Tree-Depth Decomposition Algorithm for Bounded Expansion Classes [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2015), no. 2015-623
  6. Cluster Analysis of Local Convergent Sequences of Structures [PDF file]
    (Jaroslav Nesetril, Patrice Ossona de Mendez) arXiv:1510.07788v1 (2015)
  7. Statistics of Orderings [PDF file]
    (Jaroslav Nešetřil, Vojtěch Rödl) ITI Series (2015), no. 2015-625
  8. First-order limits, an analytical perspective [PDF file]
    (Jaroslav Nesetril, Patrice Ossona de Mendez) arXiv:1503.07627v1 (2015)
2014
  1. On First-Order Definable Colorings [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2014), no. 2014-609
  2. A note on circular chromatic number of graphs with large girth and similar problems [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2014), no. 2014-606
  3. Bowtie-free graphs have a Ramsey lift [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2014), no. 2014-608
  4. Evaluation of total HCC lifespan, including both clinically evident and pre-clinical development, using combined Network Phenotyping Strategy and Fisher information analysis [PDF file]
    (Brian I. Carr, Jaroslav Nešetřil, Lubomír Skála, Peter Pancoška) ITI Series (2014), no. 2014-617
  5. On Low Tree-Depth Decompositions [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1412.1581v1 (2014)
  6. A note on circular chromatic number of graphs with large girth and similar problems [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1402.3142v1 (2014)
  7. On First-Order Definable Colorings [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1403.1995v2 (2014)
  8. Bowtie-free graphs have a Ramsey lift [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) arXiv:1402.2700v2 (2014)
  9. Strongly polynomial sequences as interpretations [PDF file]
    (Andrew Goodall, Jaroslav Nesetril, Patrice Ossona de Mendez) arXiv:1405.2449v1 (2014)
2013
  1. Inside Out, Outside In (Mathematics on a Single Snapshot) [PDF file]
    (Jaroslav Nešetřil, Miroslav Petříček) ITI Series (2013), no. 2013-580
  2. Polynomial graph invariants from homomorphism numbers [PDF file]
    (Andrew Goodall, Delia Garijo, Jaroslav Nesetril) arXiv:1308.3999v1 (2013)
  3. Flow-continuous mappings - influence of the group [PDF file]
    (Jaroslav Nešetřil, Robert Šámal) ITI Series (2013), no. 2013-591
  4. Complexities of relational structures [PDF file]
    (David Hartman, Jan Hubicka, Jaroslav Nesetril) arXiv:1309.4266v1 (2013)
  5. Invariant measures via inverse limits of finite structures [PDF file]
    (Cameron Freer, Jaroslav Nesetril, Nathanael Ackerman, Rehana Patel) arXiv:1310.8147v3 (2013)
  6. A unified approach to structural limits with application to the study of limits of graphs with bounded tree-depth [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2013), no. 2013-573
  7. Ramsey Theory in the Work of Paul Erdos [PDF file]
    (Jaroslav Nešetřil, Ron Graham) ITI Series (2013), no. 2013-574
  8. A unified approach to structural limits, and limits of graphs with bounded tree-depth [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1303.6471v2 (2013)
  9. Modeling Limits in Hereditary Classes: Reduction and Application to Trees [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1312.0441v1 (2013)
  10. A combinatorial classic - sparse graphs with high chromatic number [PDF file]
    (Jaroslav Nešetřil) ITI Series (2013), no. 2013-572
  11. A Model Theory Approach to Structural Limits [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1303.2865v1 (2013)
2012
  1. Entromics -- thermodynamics of sequence dependent base incorporation into DNA reveals novel long-distance genome organization [PDF file]
    (Jaroslav Nešetřil, Petr Pančoška, Uday Kiran Para, Zdeněk Morávek) ITI Series (2012), no. 2012-551
  2. A Model Theory Approach to Structural Limits [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2012), no. 2012-567
  3. Entromics -- thermodynamics of sequence dependent base incorporation into DNA reveals novel long-distance genome organization [PDF file]
    (Jaroslav Nesetril, Petr Pancoska, Uday Kiran Para, Zdenek Moravek) arXiv:1206.2070v1 (2012)
  4. Universal structures with forbidden homomorphisms [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2012), no. 2012-565
  5. A note on Fiedler value of classes with sublinear separators [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:1208.3581v1 (2012)
2011
  1. Colouring Edges with many Colours in Cycles [PDF file]
    (J. Nešetřil, P. Ossona de Mendez, X. Zhu) ITI Series (2011), no. 2011-532
  2. Colouring Edges with many Colours in Cycles [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez, Xuding Zhu) arXiv:1108.1616v1 (2011)
  3. On the number of B-flows of a graph [PDF file]
    (Andrew Goodall, Delia Garijo, Jaroslav Nešetřil) ITI Series (2011), no. 2011-547
  4. Contractors for flows [PDF file]
    (Andrew Goodall, Delia Garijo, Jaroslav Nešetřil) ITI Series (2011), no. 2011-546
  5. Několik poznámek o teoretické informatice [PDF file]
    (Jaroslav Nešetřil) ITI Series (2011), no. 2011-541
2010
  1. Some examples of universal and generic partial orders. [PS file]
    (Jan Hubicka, Jaroslav Nesetril) KAM-DIMATIA Series (2010), no. 2010-957
  2. Contractors for flows. [PS file]
    (D. Garijo, A. Goodall, J. Nesetril) KAM-DIMATIA Series (2010), no. 2010-984
  3. Some examples of universal and generic partial orders [PDF file]
    (Jan Hubicka, Jaroslav Nesetril) arXiv:1002.1633v3 (2010)
  4. Some examples of universal and generic partial orders [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2010), no. 2010-491
  5. Contractors for flows [PDF file]
    (Andrew Goodall, Delia Garijo, Jaroslav Nešetřil) arXiv:1011.5958v1 (2010)
  6. Distinguishing graphs by their left and right homomorphism profiles. [PS file]
    (D. Garijo, A. Goodall, J. Nesetril) KAM-DIMATIA Series (2010), no. 2010-974
2009
  1. Homomorphism and embedding universal structures for restricted classes [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) arXiv:0909.4939v2 (2009)
  2. Interleaved adjoints on directed graphs [PDF file]
    (Claude Tardif, Jan Foniok, Jaroslav Nesetril) arXiv:0905.1200v2 (2009)
  3. On nowhere dense graphs [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez) ITI Series (2009), no. 2009-450
  4. Dualities and dual pairs in Heyting algebras [PDF file]
    (Ales Pultr, Claude Tardif, Jan Foniok, Jaroslav Nesetril) arXiv:0908.0428v2 (2009)
  5. Universal structures with forbidden homomorphisms [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) arXiv:0907.4079v4 (2009)
  6. Algebraic Graph Theory, Dubrovnik 2009 [PDF file]
    (J. Nešetřil (eds.), H. Fleischner, A. Graovac, P. Hell, W. Imrich) ITI Series (2009), no. 2009-444
  7. Homomorphism and embedding universal structures for restricted classes. [PS file]
    (Jan Hubicka, Jaroslav Nesetril) KAM-DIMATIA Series (2009), no. 2009-940
  8. Homomorphism and embedding universal structures for restricted classes [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2009), no. 2009-464
  9. Dualities and dual pairs in Heyting algebras. [PS file]
    (J. Foniok, J. Nesetril, A. Pultr, C. Tardiff) KAM-DIMATIA Series (2009), no. 2009-921
  10. On characteristics of homomorphism and embedding universal graphs [PDF file]
    (Jan Hubička, Jaroslav Nešetřil) ITI Series (2009), no. 2009-458
  11. Characterisations and Examples of Graph Classes with Bounded Expansion [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez, David R. Wood) arXiv:0902.3265v2 (2009)
  12. Characterisations and Examples of Graph Classes with Bounded Expansion [PDF file]
    (Jaroslav Nešetřil, Patrice Ossona de Mendez, David R. Wood) ITI Series (2009), no. 2009-435
  13. On characteristics of homomorphism and embedding universal graphs. [PS file]
    (J. Hubicka, J. Nesetril) KAM-DIMATIA Series (2009), no. 2009-931
2008
  1. Splitting Finite Antichains in the Homomorphism Order [PDF file]
    (J. Foniok, J. Nešetřil) ITI Series (2008), no. 2008-379
  2. On a conjecture of Erdos and Turan for additive basis. [PS file]
    (J. Nesetril, O. Serra) KAM-DIMATIA Series (2008), no. 2008-891
  3. Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms. [PS file]
    (E. Lehtonen, J. Nesetril) KAM-DIMATIA Series (2008), no. 2008-890
  4. Splitting finite antichains in the homomorphism order. [PS file]
    (J. Foniok, J. Nesetril) KAM-DIMATIA Series (2008), no. 2008-850
  5. Minors of Boolean Functions with Respect to Clique Functions and Hypergraph Homomorphisms [PDF file]
    (E. Lehtonen, J. Nešetřil) ITI Series (2008), no. 2008-411
  6. Many Facets of Dualities [PDF file]
    (J. Nešetřil) ITI Series (2008), no. 2008-394
  7. Finite Dualities and Map-Critical Graphs on a Fixed Surface [PDF file]
    (J. Nešetřil, Y. Nigussie) ITI Series (2008), no. 2008-382
  8. Finite dualities and map-critical graphs on a fixed surface. [PS file]
    (J. Nesetril, Y. Nigussie) KAM-DIMATIA Series (2008), no. 2008-851
  9. Structural Properties of Sparse Graphs [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2008), no. 2008-386
  10. Many facets of dualities. [PS file]
    (J. Nesetril) KAM-DIMATIA Series (2008), no. 2008-873
  11. Splitting finite antichains in the homomorphism order [PDF file]
    (Jan Foniok, Jaroslav Nesetril) arXiv:0801.2384v2 (2008)
  12. Some recollections on early work with Jan Pelant. [PS file]
    (V. Muller, J. Nesetril, V. Rodl) KAM-DIMATIA Series (2008), no. 2008-889
  13. First Order Properties on Nowhere Dense Structures [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2008), no. 2008-387
  14. On a Conjecture of Erdos and Turán for Additive Basis [PDF file]
    (J. Nešetřil, O. Serra) ITI Series (2008), no. 2008-409
  15. Colouring, Constraint Satisfaction, and Complexity [PDF file]
    (P. Hell, J. Nešetřil) ITI Series (2008), no. 2008-413
  16. dl;Some Recollections on Early Work with Jan Pelant [PDF file]
    (V. Müller, J. Nešetřil, V. Rődl) ITI Series (2008), no. 2008-412
2007
  1. Induced Matchings and Induced Paths in Graphs [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2007), no. 2007-335
  2. Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. [PS file]
    (J. Nesetril, M. Siggers) KAM-DIMATIA Series (2007), no. 2007-823
  3. On Finite Maximal Antichains in the Homomorphism Order. [PS file]
    (J. Foniok, J. Nesetril, C. Tardif) KAM-DIMATIA Series (2007), no. 2007-813
  4. Homomorphisms and Polynomial Invariants of Graphs [PDF file]
    (D. Garijo, J. Nešetřil, M. P. Revuelta) ITI Series (2007), no. 2007-354
  5. On Finite Maximal Antichains in the Homomorphism Order [PDF file]
    (J. Foniok, J. Nešetřil, C. Tardif) ITI Series (2007), no. 2007-345
  6. Induced Matchings and Induced Paths in Graphs. [PS file]
    (J. Nesetril, P. Ossona de Mendez) KAM-DIMATIA Series (2007), no. 2007-810
  7. A New Combinatorial Approach to the Constraint Satisfaction Problem Dichotomy Classification [PDF file]
    (J. Nešetřil, M. H. Siggers) ITI Series (2007), no. 2007-346
  8. On Ramsey-type Positional Games. [PS file]
    (J. Nesetril, T. Valla) KAM-DIMATIA Series (2007), no. 2007-828
  9. A New Combinatorial Approach to the Constraint Satisfaction Problem Dichotomy Classification. [PS file]
    (J. Nesetril, M. H. Siggers) KAM-DIMATIA Series (2007), no. 2007-814
  10. On Ramsey-Type Positional Games [PDF file]
    (J. Nešetřil, T. Valla) ITI Series (2007), no. 2007-359
  11. Finite Dualities, in Particular in Full Homomorphisms [PDF file]
    (R. N. Ball, J. Nešetřil, A. Pultr) ITI Series (2007), no. 2007-364
  12. Finite dualities, in particular in full homomorphisms. [PS file]
    (R. N. Ball, J. Nesetril, A. Pultr) KAM-DIMATIA Series (2007), no. 2007-835
  13. A Finite Presentation of the rational Urysohn Space. [PS file]
    (J. Hubicka, J. Nesetril) KAM-DIMATIA Series (2007), no. 2007-821
  14. Homomorphisms and Polynomial Invariants of Graphs. [PS file]
    (D. Garijo, J. Nesetril, M. P. Revuelta) KAM-DIMATIA Series (2007), no. 2007-822
  15. Forbidden lists (NP and CSP for combinatorialists) [PDF file]
    (Gabor Kun, Jaroslav Nesetril) arXiv:0706.1704v1 (2007)
  16. NP by means of lifts and shadows [PDF file]
    (Gabor Kun, Jaroslav Nesetril) arXiv:0706.3459v1 (2007)
  17. A Surprising Permanence of Old Motivations (A Not So Rigid Story) [PDF file]
    (J. Nešetřil) ITI Series (2007), no. 2007-337
2006
  1. Homomorphisms of Structures (concepts and highlights). [PS file]
    (J. Nesetril) KAM-DIMATIA Series (2006), no. 2006-778
  2. On the Density of Trigraph Homomorphisms [PDF file]
    (P. Hell, J. Nešetřil) ITI Series (2006), no. 2006-317
  3. Linear time low tree-width partitions and algorithmic consequences [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2006), no. 2006-284
  4. Linear time low tree-width partitions and consequences . [PS file]
    (J. Nesetril, P. Ossona de Mendez) KAM-DIMATIA Series (2006), no. 2006-763
  5. Forbidden Lifts (NP and CSP for Combinatorists) [PDF file]
    (G. Kun, J. Nešetřil) ITI Series (2006), no. 2006-296
  6. DIMATIA Annual Report 2005 (10 years of DIMATIA). [PS file]
    (J. Nesetril (eds.), J. Foniok) KAM-DIMATIA Series (2006), no. 2006-765
  7. Dualities in full homomorphisms. [PS file]
    (R. N. Ball, J. Nesetril, A. Pultr) KAM-DIMATIA Series (2006), no. 2006-784
  8. Jan Pelant (in memoriam) [PDF file]
    (J. Nešetřil (eds.), V. Müller) ITI Series (2006), no. 2006-301
  9. On tension-continuous mappings [PDF file]
    (J. Nešetřil, R. Šámal) ITI Series (2006), no. 2006-283
  10. Generalised Dualities and Finite Maximal Antichains. [PS file]
    (J. Foniok, J. Nesetril, C. Tardif) KAM-DIMATIA Series (2006), no. 2006-764
  11. Dualities in Full Homomorphisms [PDF file]
    (R. N. Ball, J. Nešetřil, A. Pultr) ITI Series (2006), no. 2006-309
  12. Generalised dualities and maximal finite antichains in the homomorphism order of relational structures [PDF file]
    (J. Foniok, J. Nešetřil, C. Tardif) ITI Series (2006), no. 2006-286
  13. Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. [PS file]
    (J. Foniok, J. Nesetril, C. Tardif) KAM-DIMATIA Series (2006), no. 2006-766
  14. On the density of trigraph homomorphisms. [PS file]
    (P. Hell, J. Nesetril) KAM-DIMATIA Series (2006), no. 2006-793
  15. On tension-continuous mapings [PDF file]
    (Jaroslav Nesetril, Robert Samal) arXiv:math/0602563v1 (2006)
  16. Homomorphisms of Structures (Concepts and Highlights) [PDF file]
    (J. Nešetřil) ITI Series (2006), no. 2006-299
  17. Forbidden Lifts (NP and CSP for combinatorists). [PS file]
    (G. Kun, J. Nesetril) KAM-DIMATIA Series (2006), no. 2006-775
  18. On tension-continuous mappings. [PS file]
    (J. Nesetril, R. Samal) KAM-DIMATIA Series (2006), no. 2006-780
  19. Generalised Dualities and Finite Maximal Antichains (extended abstract) [PDF file]
    (J. Foniok, J. Nešetřil, C. Tardif) ITI Series (2006), no. 2006-285
2005
  1. The grad of a graph and classes with bounded expansion [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2005), no. 2005-253
  2. Tension continuous maps - their structure and applications [PDF file]
    (J. Nešetřil, R. Šámal) ITI Series (2005), no. 2005-242
  3. Ramsey Classes and homogeneous structures [PS file]
    (J. Nešetřil) Comb. Prob. Comp. (2005), no. 14, 171-189
  4. Diameters of duals are linear [PS file]
    (J. Nešetřil, I. Švejdarová) KAM-DIMATIA Series (2005), no. 2005-729
  5. Grad and Classes with Bounded Expansion I. Decompositions [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2005), no. 2005-739
  6. Cuts and bounds [PS file]
    (J. Nešetřil, P. Ossona de Mendez) Discrete Math. (2005)
  7. Universal partial order represented by means of oriented trees and other simple graphs
    (J. Hubička, J. Nešetřil) European J. Comb. (2005), no. 26, 765-778
  8. Tension continuous maps--their structure and applications [PDF file]
    (Jaroslav Nesetril, Robert Samal) arXiv:math/0503360v1 (2005)
  9. ACCOTA volume
    (editor: S. Eliahou, I. Gittler, J. Nešetřil) Discrete Math. (2005)
  10. Aesthetic for Computers or How to Measure a Harmony
    (J. Nešetřil) In: Visual Mind 2 (editor M. Emmer), MIT Press (2005), 35-58
  11. Grad and Classes with Bounded Expansion III. Restricted Dualities [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2005), no. 2005-741
  12. Grad and Classes with Bounded Expansion II. Algorithmic Aspects [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2005), no. 2005-740
  13. Grad and classes with bounded expansion III. restricted dualities [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:math/0508325v1 (2005)
  14. Grad and Classes with Bounded Expansion III. Restricted Graph Homomorphism Dualities [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2005), no. 2005-264
  15. Constraint Satisfaction with Countable Homogeneous Templates. [PS file]
    (M. Bodirsky, J. Nesetril) KAM-DIMATIA Series (2005), no. 2005-728
  16. The Grad of a Graph and Classes with Bounded Expansion. [PS file]
    (J. Nesetril, P. Ossona de Mendez) KAM-DIMATIA Series (2005), no. 2005-732
  17. Grad and Classes with Bounded Expansion II. Algorithmic Aspects [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:math/0508324v2 (2005)
  18. Grad and classes with bounded expansion I. decompositions [PDF file]
    (Jaroslav Nesetril, Patrice Ossona De Mendez) arXiv:math/0508323v1 (2005)
  19. Acyclic edge chromatic number of random d-regular graphs is d+1
    (J. Nešetřil, N. Wormald) J. Graph Th. (2005), no. 49, 69-74
2004
  1. Rainbow Ramsey Theory [PS file]
    (V. Jungic, J. Nešetřil, R. Radoicic) KAM-DIMATIA Series (2004), no. 2004-664
  2. A note on projective graphs [PS file]
    (T. Luczak, J. Nešetřil) J. Graph Th. (2004), no. 47, 81-86
  3. Universality of separoids [PDF file]
    (J. Nešetřil, R. Strausz) ITI Series (2004), no. 2004-228
  4. Density of Universal classes in G/K_4 [PS file]
    (J. Nešetřil, Y. Nigussie) KAM-DIMATIA Series (2004), no. 2004-717
  5. Antisymmetric Flows and Edge-Connectivity [PS file]
    (M. DeVos, J. Nešetřil, A. Raspaud) Discrete Math. 276 (2004), no. 1-3, 287-294
  6. Metric Spaces are Ramsey [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2004), no. 2004-677
  7. Minimal Universal and Dense Minor Closed Classes [PS file]
    (J. Nešetřil, Y. Nigussie) KAM-DIMATIA Series (2004), no. 2004-666
  8. Counting list homomorphisms and graphs with bounded degrees [PS file]
    (P. Hell, J. Nešetřil) In: J. Nešetřil, P. Winkler: Graphs, morphisms and statistical physics, DIMACS Series, AMS (2004), no. 63, pp.105-112
  9. Finite Presentation of Homogeneous Graphs, Posets and Ramsey Classes [PS file]
    (J. Hubička, J. Nešetřil) KAM-DIMATIA Series (2004), no. 2004-675
  10. Short answers to exponentially long questions: Extremal aspects of homomorphism duality [PS file]
    (J. Nešetřil, C. Tardif) KAM-DIMATIA Series (2004), no. 2004-714
  11. On sparse graphs with given colorings and homomorphisms [PS file]
    (J. Nešetřil, X. Zhu) J. Comb. Th. B (2004), no. 90, 161-172
  12. Tension continuous maps - their structure and application [PS file]
    (J. Nešetřil, R. Šámal) KAM-DIMATIA Series (2004), no. 2004-712
  13. A Ramsey property of planar graphs [PDF file]
    (J. Nešetřil, J. Solymosi, P. Valtr) In: Contemporary Mathematics, Amer. Math. Soc. (2004), no. 342, pp. 169-176
  14. Towards Mathematical Aesthetics [PS file]
    (M. Bálek, J. Nešetřil) KAM-DIMATIA Series (2004), no. 2004-704
  15. On the order of countable graphs [PDF file]
    (Jaroslav Nešetřil, Saharon Shelah) arXiv:math/0404319v1 (2004)
  16. On Sparse Graphs with Given Colorings and Homomorphism
    (J. Nešetřil, X. Zhu) J. Comb. Th. B (2004), no. 90, 161-172
  17. Tree depth, subgraph coloring and homomorphism bounds [PDF file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2004), no. 2004-179
  18. A Ramsey property of planar graphs [PS file]
    (J. Nešetřil, J. Solymosi, P. Valtr) KAM-DIMATIA Series (2004), no. 2004-672
  19. Tree depth, subgraph coloring and homomorphism bounds [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2004), no. 2004-656
  20. Towards mathematical aesthetics [PDF file]
    (M. Bálek, J. Nešetřil) ITI Series (2004), no. 2004-231
  21. Short answers to exponentially long questions: Extremal aspects of homomorphism duality [PDF file]
    (J. Nešetřil, C. Tardif) ITI Series (2004), no. 2004-222
  22. Ramsey Property of Planar Graphs
    (J. Nešetřil, J. Solymosi, P. Valtr) In: Amer Math. Soc., Contemporary Mathematics (2004), no. 342, pp. 169-176
  23. Introduction aux mathematiques discretes
    (J. Matoušek, J. Nešetřil) Springer Paris (2004)
  24. Metric spaces are Ramsey [PDF file]
    (J. Nešetřil) ITI Series (2004), no. 2004-198
  25. Graphs, morphisms and statistical physics
    (J. Nešetřil, P. Winkler) DIMACS Series, AMS (2004), no. 63, p.193
  26. On Covers of Graphs [PS file]
    (J. Maxová, J. Nešetřil) Discrete Math. 276 (2004), no. 1-3, 287-294
  27. Universality of Separoids [PS file]
    (J. Nešetřil, R. Strausz) KAM-DIMATIA Series (2004), no. 2004-705
  28. The Erdős - Turán property for a class of bases [PS file]
    (J. Nešetřil, O. Serra) Acta arithmetica 115 (2004), no. 3, 245-254
  29. Graphs and homomorphisms
    (P. Hell, J. Nešetřil) Oxford University Press (2004), pp. 250
2003
  1. On the Order of Countable Graphs [PS file]
    (J. Nešetřil, S. Shelah) European J. Comb. (2003), no. 24, 649-663
  2. The Erdős-Turán Property for a Class of Bases [PS file]
    (J. Nešetřil, O. Serra) KAM-DIMATIA Series (2003), no. 2003-642
  3. When is a random graph projective? [PS file]
    (T. Luczak, J. Nešetřil) ITI Series (2003), no. 2003-158
  4. Universal Partial Order Represented by Means of Trees and Other Simple Graphs [PS file]
    (J. Hubička, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-620
  5. A probabilistic approach to the dychotomy problem [PS file]
    (T. Luczak, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-640
  6. Rainbow Arithmetic Progressions and Anti-Ramsey Results [PS file]
    (V. Jungic, J. Licht, M. Mahdian, J. Nešetřil, R. Radoicic) Comb. Prob. Comp. (2003), no. 12, 599-620
  7. Antisymmetric Flows in Matroids [PS file]
    (W. Hochstättler, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-644
  8. Gaps and Dualities in Heyting categories [PS file]
    (J. Nešetřil, A. Pultr, C. Tardif) KAM-DIMATIA Series (2003), no. 2003-651
  9. Coloring and Homomorphisms of Minor Closed Classes
    (J. Nešetřil, P. Ossona de Mendez) In: Discrete an Computational Geometry - R. Pollack Festshrift, Springer Verlag (2003), 651-664
  10. Invitation to Discrete Mathematics
    (J. Matoušek, J. Nešetřil) Springer (Tokyo) (2003), in japanese
  11. Constraint Satisfaction with Countable Homogeneous Templates [PS file]
    (M. Bodirsky, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-624
  12. A probabilistic approach to the dichotomy problem [PS file]
    (T. Luczak, J. Nešetřil) ITI Series (2003), no. 2003-152
  13. On homogeneous graphs and posets [PS file]
    (J. Hubička, J. Nešetřil) ITI Series (2003), no. 2003-113
  14. On Homogeneous Graphs and Posets [PS file]
    (J. Hubička, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-606
  15. On projective graphs [PS file]
    (T. Luczak, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-619
  16. Constraint satisfaction with countable homogeneous templates [PS file]
    (M. Bodirsky, J. Nešetřil) LNCS 2803, Springer Verlag (2003), 44-57
  17. Finite paths are universal [PS file]
    (J. Hubička, J. Nešetřil) ITI Series (2003), no. 2003-129
  18. Antisymmetric flows on matroids [PS file]
    (W. Hochstättler, J. Nešetřil) ITI Series (2003), no. 2003-157
  19. Ramsey Classes and Homogeneous Structures [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-643
  20. EUROCOMB'01 proceedings
    (editor: J. Nešetřil, M. Noy, O. Serra) Discrete Math. (2003), no. 273, 1-278
  21. Antisymmetric flows and edge connectivity
    (M. DeVos, J. Nešetřil, A. Raspaud) Discrete Math. 276 (2003), no. 1-3, 161-167
  22. Measuring of Aesthetic Invariant of Images [PS file]
    (M. Bálek, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-625
  23. Finite Paths are Universal [PS file]
    (J. Hubička, J. Nešetřil) KAM-DIMATIA Series (2003), no. 2003-621
  24. Measuring of aesthetic invariant of images [PS file]
    (M. Bálek, J. Nešetřil) ITI Series (2003), no. 2003-135
  25. A note on random homomorphisms from arbitrary graphs to Z
    (M. Löbl, J. Nešetřil, B. Reed) Discrete Math. (2003), no. 273, 173-181
  26. On maximal finite antichains in the homomorphism order of directed graphs [PS file]
    (J. Nešetřil, C. Tardif) Discuss. Math. Graph Theory 23 (2003), no. 2, 325-332
2002
  1. Density via Duality [PS file]
    (J. Nešetřil, C. Tardif) Theor. Comp. Sci. 287 (2002), no. 2, 585-591
  2. Folding [PS file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2002), no. 2002-089
  3. Commencement Address 2002 [PS file]
    (C. Flintoff, J. Nešetřil editor) ITI Series (2002), no. 2002-070
  4. Rainbow Arithmetic Progressions and Anti-Ramsey Results [PS file]
    (V. Jungic, J. Licht, M. Mahdian, J. Nešetřil, R. Radoicic) KAM-DIMATIA Series (2002), no. 2002-590
  5. More about subcolorings [PS file]
    (H. Brörsma, F. V. Fomin, J. Nešetřil, G. J. Wöginger) KAM-DIMATIA Series (2002), no. 2002-568
  6. A Note on Random Homomorphism from Arbitrary Graphs to Z [PS file]
    (M. Löbl, J. Nešetřil, B. Reed) KAM-DIMATIA Series (2002), no. 2002-546
  7. More about subcolorings [PS file]
    (H. Brörsma, F. V. Fomin, J. Nešetřil, G. J. Wöginger) In: Graph Theoretical Concepts in Computer Science (WG 2002),LNCS 2573, Springer (2002), pp. 68-79
  8. Nilpotent families of endomorphisms and nice graphs [PS file]
    (D. Fon-Der-Flaass, A. V. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena) J. Comb. Th. B (2002), no. 86, 100-108
  9. Ramsey Theory and Paul Erdős (recent results in a historical perspective) [PS file]
    (R. L. Graham, J. Nešetřil) In: Paul Erdős and his Mathematics. II, Bolyai Society Math. Studies 11, Springer Verlag (2002), pp. 339-365
  10. A Rigid Graph For Every Set [PS file]
    (J. Nešetřil) J. Graph Th. 39 (2002), no. 2, 108-110
  11. Universal H-colorable graphs without a given configuration [PS file]
    (P. Dreyer, Ch. Malon, J. Nešetřil) Discrete Math. (2002), no. 250, 245-252

  12. (editor: J. Nešetřil) Theor. Comp. Sci. 287 (2002), no. 2
  13. H-colorings of Large Degree Graphs [PS file]
    (J. Diaz, J. Nešetřil, M. Serna, D. M. Thilikos) KAM-DIMATIA Series (2002), no. 2002-560
  14. Art of Drawing and Art
    (J. Nešetřil) In: Graph Drawing and Representations: Special Issue on Selected Papers from JGAA (Journal of Graph Algorithms and Applications) 6 (2002), no. 2, pp. 131-147
  15. Cuts and Bounds [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2002), no. 2002-592
  16. On flow and tension-continuous maps [PS file]
    (M. DeVos, J. Nešetřil, A. Raspaud) KAM-DIMATIA Series (2002), no. 2002-567
  17. Diskrete Mathematik (eine Entdeckungsreise)
    (J. Matoušek, J. Nešetřil) Springer (2002)
  18. Selected Papers from ESA'03
    (editor: J. Nešetřil) Theor. Comp. Sci. 287 (2002), no. 2, pp. 355-620, Preface, ibidem p. 355-357
  19. H-colorings of large degree graphs [PS file]
    (J. Diaz, J. Nešetřil, M. Serna, D. M. Thilikos) In: EurAsia-ICT 2002 (editors Hassan Shafazad, Min Tjoa), Lecture Notes in Computer Science 2510, Springer (2002), pp. 851-857
  20. Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations [PS file]
    (J. Maxová, J. Nešetřil) ESA'02, LNCS (2002)
  21. Folding [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2002), no. 2002-585
  22. Compatible Decompositions of Eulerian Graphs and Their Transformations [PS file]
    (J. Maxová, J. Nešetřil) ITI Series (2002), no. 2002-063
  23. On Flow and Tension-Continuous Maps [PS file]
    (M. DeVos, J. Nešetřil, A. Raspaud) ITI Series (2002), no. 2002-067
2001
  1. On oriented path double covers
    (J. Maxová, J. Nešetřil) Discrete Math. (2001), no. 233, 371-380
  2. A Dualistic Approach to Bounding the Chromatic Number of a Graph [PS file]
    (J. Nešetřil, C. Tardif) ITI Series (2001), no. 2001-036
  3. Combinatorics
    (editor: M. Fiedler, J. Kratochvíl, J. Nešetřil) Discrete Math. 235 (2001), no. 1-3, p. 425
  4. Homomorphism Bounded Classes of Graphs [PS file]
    (T. H. Marshall, R. Naserasr, J. Nešetřil) KAM-DIMATIA Series (2001), no. 2001-529
  5. Towards an Aesthetic Invariant for Graph Drawing [PS file]
    (R. Adamec, J. Nešetřil) Graph Drawing'01, Lecture Notes in Computer Science (2001), no. 2265, 287-296
  6. Art of Graph Drawing and Art [PS file]
    (J. Nešetřil) ITI Series (2001), no. 2001-035
  7. Calculating Sequence Dependent Melting Stability of Duplex DNA Oligomers and Multiplex Sequence Analysis by Graphs
    (A. S. Benight, J. Nešetřil, R. Owczarzy, P. Pančoška, P. V. Riccelli, P. M. Valtone) In: Methods in Enzymology, vol. 340: Drug-Nucleid Acid Interaction (editors J. B. Claires, M. J. Waring), Academic Press (2001), pp.165-192
  8. Art of Graph Drawing and Art [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2001), no. 2001-537
  9. The acyclic edge chromatic number of a random d-regular graph is d+1 [PS file]
    (J. Nešetřil, N. C. Wormald) KAM-DIMATIA Series (2001), no. 2001-528
  10. Nilpotent Families of Endomorphisms of (P(V)+, U) [PS file]
    (D. Fon-Der-Flaass, A. V. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena) ITI Series (2001), no. 2001-013
  11. Coloring and homomorphism of degenerate and bounded degree graphs [PS file]
    (A. V. Kostochka, J. Nešetřil, P. Smolíková) Discrete Math. 233 (2001), no. 1-3, 257-276
  12. A note on homomorphism independent families [PS file]
    (J. Nešetřil, A. Pultr) Discrete Math. (2001), no. 235, 327-334
  13. Colorings and Homomorphisms of Minor Closed Classes [PS file]
    (J. Nešetřil, P. Ossona de Mendez) ITI Series (2001), no. 2001-025
  14. Vojtěch Jarník work in combinatorial optimization
    (B. Korte, J. Nešetřil) Discrete Math. 235 (2001), no. 1-3, 1-17
  15. I. Schur, C. E. Shannon and Ramsey Numbers, a Short Story [PS file]
    (J. Nešetřil, M. Rosenfeld) In: Discrete Math. 229 (2001), no. 1-3, 185-196
  16. Graph Theory
    (editor: M. Fiedler, J. Kratochvíl, J. Nešetřil) Discrete Math. 233 (2001), no. 1-3, p. 393
  17. Some remarks on art and mathematics (understanding Moves of Hubert Damisch)
    (J. Nešetřil) In: Concept of Dimension in Science and Arts, Cahiers Art et Science (editor R. Pervolovici), Caietele Meta (2001)
  18. On faithfull covers of graphs
    (J. Maxová, J. Nešetřil) In: Proceedings of 3rd Scientific Coll., Dept. of Math., Institute of Chemical Technology, Prague (2001), pp. 130-135, ISBN 80-7080-423-8
  19. Constructions of sparse graphs with Prescribed Circular Colorings
    (J. Nešetřil, X. Zhu) Discrete Math. 233 (2001), no. 1-3, 277-291
  20. Otakar Borůvka - origins of the MST-problem [PS file]
    (E. Milková, J. Nešetřil, H. Nešetřilová) Discrete Math. (2001), no. 233, 3-36
  21. On Maximal Finite Antichains in the Homomorphism Order of Directed Graphs [PS file]
    (J. Nešetřil, C. Tardif) KAM-DIMATIA Series (2001), no. 2001-536
  22. Ramsey Theory and Paul Erdős (recent results from a historical perspective) [PS file]
    (R. L. Graham, J. Nešetřil) ITI Series (2001), no. 2001-7
  23. A Dualistic Approach to Bounding the Chromatic Number of a Graph [PS file]
    (J. Nešetřil, C. Tardif) KAM-DIMATIA Series (2001), no. 2001-538
  24. Colorings and Homomorphisms of Minor Closed Graphs [PS file]
    (J. Nešetřil, P. Ossona de Mendez) KAM-DIMATIA Series (2001), no. 2001-523
  25. Combinatorics, graph theory, algorithms and applications
    (editor: M. Fiedler, J. Kratochvíl, J. Nešetřil) Discrete Math. 229 (2001), no. 1-3, p. 411
  26. Counting List Homomorphisms and Graphs with Bounded Degree [PS file]
    (P. Hell, J. Nešetřil) KAM-DIMATIA Series (2001), no. 2001-521
2000
  1. Combinatorics of Mappings (Lecture text for Spring School on Combinatorics 2000) [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-472
  2. Duality Theorems for Finite Structures (Characterizing Gaps and Good Characterizations)
    (J. Nešetřil, C. Tardif) J. Comb. Th. B (2000), no. 80, 80-97
  3. On colorings of dense graphs [PS file]
    (J. Diaz, J. Nešetřil, M. Serna, D. M. Thilikos) KAM-DIMATIA Series (2000), no. 2000-465
  4. Three and More Set Theorem
    (P. Hell, J. Nešetřil, A. Raspaud, E. Sopena) Comment. Math. Univ. Carolinae 41 (2000), no. 4, 793-802
  5. Otakar Boruvka on minimum spanning tree problem [PS file]
    (E. Milková, J. Nešetřil, H. Nešetřilová) KAM-DIMATIA Series (2000), no. 2000-466
  6. The complexity of H-colouring of bounded degree graphs [PS file]
    (A. Galluccio, P. Hell, J. Nešetřil) Discrete Math. (2000), no. 222, 101-109
  7. El Arte de Conjeturar y Demostrat
    (J. Nešetřil) Números 43 (2000), no. 44, 449-454
  8. The Coloring Poset and its On-Line Universality [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-458
  9. On Universality of Set Systems [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-491
  10. El Arte de Conjeturar y Demostrat
    (J. Nešetřil) In: Les matemáticas del siglo XX (editor A. Martinón), Nivola (Madrid) (2000), pp. 449-454
  11. Colored Homomorphisms of Colored and Mixed Graphs [PS file]
    (J. Nešetřil, A. Raspaud) J. Comb. Th. B (2000), no. 80, 147-155
  12. A note on Max Flow - Min Cut and Homomorphic Equivalence of Matroids [PS file]
    (W. Hochstättler, J. Nešetřil) J. Algebraic Comb. (2000), no. 12, 295-300
  13. Colouring relatives of intervals on the plane, II: intervals and rays in two directions [PS file]
    (A. V. Kostochka, J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-462
  14. Kapitoly z diskrétní matematiky
    (J. Matoušek, J. Nešetřil) Nakladatelství Karolinum (2000), second edition 2003
  15. Construction of sparse graphs with prescribed circular colorings [PS file]
    (J. Nešetřil, X. Zhu) KAM-DIMATIA Series (2000), no. 2000-457
  16. Partitions of Graphs into Cographs
    (J. Gimbel, J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-470, Kalamazoo Conf.
  17. The Art of Proving and Conjecturing [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (2000), no. 2000-464
1999
  1. Density via Duality [PS file]
    (J. Nešetřil, C. Tardif) KAM-DIMATIA Series (1999), no. 99-429
  2. Algorithms - ESA´99
    (editor: J. Nešetřil) Lecture Notes in Computer Science, Springer Verlag (1999), no. 1643, p. 552
  3. Induced monochromatic configurations
    (J. Nešetřil, J. Solymosi, P. Valtr) In: Contemporary Trends in Discrete Mathematics, AMS, DIMACS Series (1999), no. 49, pp. 219 - 228
  4. Aspects of structural combinatorics [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (1999), no. 99-435
  5. Embedding graphs in Euclidean spaces, an exploration guided by Paul Erdős [PS file]
    (J. Nešetřil, M. Rosenfeld) KAM-DIMATIA Series (1999), no. 99-439
  6. Antropogeometry I, II
    (J. Načeradský, J. Nešetřil) Rabasova Galerie, Rakovník (1999), Czech and English, ISBN 80-85868-25-3
  7. Aspects of Structural Combinatorics (Graph Homomorphisms and Their Use)
    (J. Nešetřil) Taiwanese J. Math. 3 (1999), no. 4, 381-424
  8. Antisymmetric Flows and Strong Colourings of Oriented Graphs
    (J. Nešetřil, A. Raspaud) Ann. De l´ Institute Fourier, Grenoble (1999), no. 49, 1037 - 1056
  9. Linear progamming duality and morhisms
    (W. Hochstättler, J. Nešetřil) Comment. Math. Univ. Carolinae 40 (1999), no. 3, 557 - 592
  10. I. Schur, C.E. Shannon an Ramsey Numbers, a short story [PS file]
    (J. Nešetřil, M. Rosenfeld) KAM-DIMATIA Series (1999), no. 99-449
  11. The Homomorphism Structure of Classes of Graph
    (J. Nešetřil) Comb. Prob. Comp. (1999), no. 8, 177 - 184
  12. Spectra, graphs and proteins, Towards of understanding of protein folding
    (V. Janota, J. Nešetřil, P. Pančoška) In: Contemporary Trends in Discrete Mathematics, AMS, DIMACS Series (1999), no. 49, 237-255
  13. On oriented path double covers [PS file]
    (J. Maxová, J. Nešetřil) KAM-DIMATIA Series (1999), no. 99-432
  14. Trends in Discrete Mathematics
    (editor: R. L. Graham, J. Kratochvíl, J. Nešetřil, F. Roberts) AMS, DIMACS Series (1999), no. 49
  15. Graph designs
    (J. Kratochvíl, J. Nešetřil, M. Rosenfeld) Hadamard matrices and Geometric Configurations. In: Bolayi Math. Studies 7, Budapest (1999), 101 - 123
  16. DIMATIA 1997-1999 [PS file]
    (V. Janota, J. Kratochvíl, J. Nešetřil) KAM-DIMATIA Series (1999), no. 99-444
  17. Four Coloring Problems [PS file]
    (J. Nešetřil, E. Sopena) KAM-DIMATIA Series (1999), no. 99-418, p. 48
  18. Vojtěch Jarník´s work in combinatorial optimization
    (B. Korte, J. Nešetřil) In: Life and work of Vojtěch Jarník, Prometheus, Praha (1999), 37-54
  19. On the maximal average degree and the oriented chromatic number of a graph
    (O. V. Borodin, A. V. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena) Discrete Math. 206 (1999), no. 1-3, 77-86
  20. Art of Drawing [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (1999), no. 99-437
  21. Duality, Nowhere - Zero Flows, Colorings and Cycle Covers [PS file]
    (J. Nešetřil, A. Raspaud) KAM-DIMATIA Series (1999), no. 99-422, p. 49
  22. Density [PS file]
    (J. Nešetřil, C. Tardif) In: Contemporary Trends in Discrete Mathematics, AMS, DIMACS Series (1999), no. 49, pp. 229 - 236
1998
  1. Invitation to Discrete Mathematics
    (J. Matoušek, J. Nešetřil) Oxford University Press (1998)
  2. Structure of graph homomorphisms I
    (J. Nešetřil) In: Graph Theory Notes of New York (1998), no. XXXV, 7 - 12
  3. Coloring relatives of intervals on the plane I: Chromatic number versus Girth
    (A. V. Kostochka, J. Nešetřil) European J. Comb. (1998), no. 19, 103 - 110
  4. The complexity of H-colouring of bounded degree graphs [PS file]
    (A. Galluccio, P. Hell, J. Nešetřil) KAM-DIMATIA Series (1998), no. 98-397
  5. Antiszmmetric Flows and Strong Colourings of Oriented Graphs [PS file]
    (J. Nešetřil, A. Raspaud) KAM-DIMATIA Series (1998), no. 98-405
  6. Structure of the graph homomorphisms II [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (1998), no. 98-381
  7. On universal graphs for planar oriented graphs of a given girth
    (O. V. Borodin, A. V. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena) Discrete Math. (1998), no. 188, 73 - 85
  8. Duality theorems for Finite Structures (characterising gaps and good characterisations) [PS file]
    (J. Nešetřil, C. Tardif) KAM-DIMATIA Series (1998), no. 98-407
  9. A Ramsey property of order Types
    (J. Nešetřil, P. Valtr) J. Comb. Th. A 81 (1998), no. 1, 88 - 107
1997
  1. Novel Matrix Descriptor for Spectroscopic Determination of the Connectivity of Secondary Structure Segments in Proteins. Analysis of General Properties Using Graph Theory
    (V. Janota, T. A. Kleiderling, J. Nešetřil, P. Pančoška) KAM-DIMATIA Series 97-363 (1997)
  2. Mathematics of Paul Erdős
    (R. L. Graham, J. Nešetřil) Volume I, Springer Verlag (1997), p. 399
  3. Mathematics of Paul Erdős
    (R. L. Graham, J. Nešetřil) Volume II, Springer Verlag (1997), p. 577
  4. A few remarks on the history of MST - problem
    (J. Nešetřil) Archivum Math. (1997), no. 33, 15 - 22
  5. Graph designs, Hadamard matrices and geometric configurations [PS file]
    (J. Kratochvíl, J. Nešetřil, M. Rosenfeld) KAM-DIMATIA Series (1997), no. 97-343
  6. Solving and approximating combinatorial optimization problems (toward MAXCUT and TSP)
    (J. Nešetřil, D. Turzík) Lecture Notes in Computer Science, Springer Verlag (1997), no. 1338, 70 - 85
  7. Paul Erdős - a few memories
    (J. Nešetřil) Geocombinatorics VI (1997), no. 3, 90 - 98
  8. Karl Marx - Retrospective 1968 - 1997 Czech
    (J. Nešetřil, V. Zoubek) Rabasova Galerie, Rakovník (1997), ISBN 80-85868-14-8
  9. Solving and approximating combinatorial optimization problems ( toward MAX CUT and TSP ) [PS file]
    (J. Nešetřil, D. Turzík) KAM-DIMATIA Series (1997), no. 97-368
  10. On universal graphs for planar oriented graphs of a given girth [PS file]
    (O. V. Borodin, A. V. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena) KAM-DIMATIA Series (1997), no. 97-357
  11. Ramsey theory in the work of Paul Erdős
    (R. L. Graham, J. Nešetřil) In: Mathematics of P. Erdős, Springer Verlag (1997), pp. 193 - 209
  12. Colorings and girth of oriented planar graphs
    (J. Nešetřil, A. Raspaud, E. Sopena) Discrete Math. (1997), no. 165-166, 519 - 530
  13. Linearity an unprovability of Set Union Problem Strategies I. Linearity of Strong Postorder
    (M. Löbl, J. Nešetřil) J. of Algorithms (1997), no. 23, 207 - 220
  14. Embedding graphs in Euclidean Spaces, an exploration guided by Paul Erdős
    (J. Nešetřil, M. Rosenfeld) Geocombinatorics IV (1997), no. 4, 143-144
  15. Moderní diskrétní matematika II
    (J. Nešetřil) Proceedings of Conference Šlapanice 1997, KAM Series (1997), no. 97-366
  16. T-preserving Homomorphisms of Oriented Graphs Comment
    (J. Nešetřil, E. Sopena, L. Vignal) Math. Univ. Carol. 38 (1997), no. 1, 125 - 136
  17. Structure of graph homomorphisms I [PS file]
    (J. Nešetřil) KAM-DIMATIA Series (1997), no. 97-367
1996
  1. Duality and polynomial testing of tree homomorphisms
    (P. Hell, J. Nešetřil, X. Zhu) Trans. Amer. Math. Soc. 348 (1996), no. 4, 1281 - 1297
  2. A remark on Pisier type theorems
    (P. Erdős, J. Nešetřil, V. Rödl) Congressus Numerantium (1996), no. 113, 101 - 109
  3. High girth and extendability
    (P. Grozdjak, J. Nešetřil) Discrete Math. 154 (1996), no. 1-3, 77 - 84
  4. Linear programming duality and morphisms [PS file]
    (W. Hochstättler, J. Nešetřil) KAM-DIMATIA Series (1996), no. 96-334
  5. Chapters from Discrete Mathematics
    (J. Matoušek, J. Nešetřil) Mat. Fyz. Press, Praha (1996), Czech
  6. Path homomorphisms
    (J. Nešetřil, X. Zhu) Proc. Cambridge Phi. Soc. (1996), no. 120, 207 - 220
  7. M Fiedler - life and work
    (I. Havel, J. Nešetřil, Z. Vavřín) KAM Series (1996), no. 96-317, Czech
  8. Coloring relatives of intervals on the plane I: Chromatic number versus girth [PS file]
    (A. V. Kostochka, J. Nešetřil) KAM-DIMATIA Series (1996), no. 96-321
  9. On bounded treewidth duality of graphs [PS file]
    (J. Nešetřil, X. Zhu) KAM-DIMATIA Series (1996), no. 96-322
  10. On bounded tree width duality of graph homomorphisms
    (J. Nešetřil, X. Zhu) J. Graph Th. (1996), no. 23, 151 - 162
  11. Matchability of Hadamard matrices
    (J. Kratochvíl, J. Nešetřil, M. Rosenfeld) Congressus Numerantium (1996), no. 117, 175 - 185
  12. Moderní diskretní matematika
    (J. Nešetřil) KAM Series (1996), no. 96-329
  13. About a picture on a poster
    (J. Načeradský, J. Nešetřil) KAM Series (1996), no. 96-330, (Czech and English)
  14. Combinatorics and quantifiers Comment
    (J. Nešetřil, J. Väänänen) Math. Univ. Carol. 37 (1996), no. 3, 433 - 443
  15. Complexity of three homomorphisms
    (P. Hell, J. Nešetřil, X. Zhu) Discrete Appl. Math. (1996), no. 70, 23 - 36
  16. Duality of graph homomorphisms
    (P. Hell, J. Nešetřil, X. Zhu) Combinatorics, P. Erdős in eighty, Bolyai Soc. Math. Studies (1996), no. 2, 271 - 282
  17. M. Fiedler is 70
    (editor: I. Havel, J. Nešetřil, Z. Ryjáček) KAM Series (1996), no. 96-317
1995
  1. How to color shift hypergraphs
    (N. Alon, I. Kříž, J. Nešetřil) In: Combinatorics and its applications to regularity and irregularity of structures (editors W. Deuber, V. T. Sós), Akadémiai Kiadó, Budapest (1995), 1-11
  2. Ramsey Theory
    (J. Nešetřil) In: Handbook of Combinatorics (editors R. L. Graham, M. Grötschel, L. Lovász), North-Holland (1995), 1125 - 1213
  3. Antropogeometrie
    (J. Načeradský, J. Nešetřil) Vesmír (1995), no. 10, 599-600
  4. More on the complexity of cover graph
    (J. Nešetřil, V. Rödl) Comment. Math. Univ. Carolinae (1995), no. 36, 269 - 278
  5. Graph Homomorphisms and their structure
    (J. Nešetřil) In: Graph Theory, Combinatorics and Algorithms (editors Y. Alavi, A. Schwenk), J. Wiley and Sons (1995), 825 - 832
  6. On 2-/v,4,x/ - Designs without Pair Intersections
    (H. D. Gronau, J. Nešetřil) Ars Combinatorica (1995), no. 39, 161 - 166
  7. Unfinished interview (about art and randomness) (in czech)
    (M. Mendes France, J. Nešetřil) Ateliér (1995), no. 14,15, p. 12
  8. How to color shift hypergraphs
    (N. Alon, I. Kříž, J. Nešetřil) Studia Sci. Math. Hung. (1995), no. 30, 1 - 11
  9. Related by a choice (in czech)
    (J. Načeradský, J. Nešetřil) Ateliér (1995), no. 14,15, p. 12
  10. Chapters from Discrete Mathematics
    (J. Matoušek, J. Nešetřil) KAM Series (1995), no. 95-299, p. 250, Czech
  11. Fragments of a dialogue
    (M. Mendes France, J. Nešetřil) KAM Series (1995), no. 95-308
1994
  1. On ordered graphs and graph orderings
    (J. Nešetřil) Discrete Appl. Math. (1994), no. 51, 113 - 116
  2. A Ramsey-type theorem in the plane
    (J. Nešetřil, P. Valtr) Comb. Prob. Comp. (1994), no. 3, 127 - 135
1993
  1. Mathematics and Art
    (J. Nešetřil) From the Logical Point of View 2,2 Philosophical Institute Czech Academy of Sciences, Prague (1993), 50 - 72, german translation Universität Bielefeld 1991
  2. Remarks on relationship of mathematics and art, Part I
    (J. Nešetřil) Ateliér (1993), no. 23, p. 2, in czech
  3. Remarks on relationship of mathematics and art, Part II
    (J. Nešetřil) Ateliér (1993), no. 24, p. 2, in czech
  4. Complexity of Diagrams
    (J. Nešetřil, V. Rödl) Order (1993), no. 10, 393, Corrigendum
  5. Notes on the Relation of Mathematics and Art, Part II
    (J. Nešetřil) Ateliér (1993), no. 24,25, Czech, English summary
  6. Notes on the Relation of Mathematics and Art, Part I
    (J. Nešetřil) Ateliér (1993), no. 23, Czech, English summary
1992
  1. On the computational complexity of Seidel´s switching
    (J. Kratochvíl, J. Nešetřil, O. Zýka) Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Prachatice, 1990). Ann. Discrete Math., 51, North-Holland, Amsterdam (1992), 161 - 166, English summary
  2. Fourth Czechoslovakian Symposium on Combinatorics
    (editor: M. Fiedler, J. Nešetřil) Algorithms and Complexity, Prachatice (1990). Annals of Discrete Marth. 51, North-Holland, Amsterdam (1992), p. 400
  3. Zdeněk Frolík, his life and work
    (B. Balcar, J. Nešetřil, J. Pelant, V. Rödl, P. Simon) In: Topological, algebraical and combinatorial structures, Topics Discrete Math., 8, North-Holland, Amsterdam (1992), pp. XVII-XXII
  4. Minimal asymmetric graphs of induced length 4
    (J. Nešetřil, G. Sabidussi) Graphs Combin. 8 (1992), no. 4, 343 - 359
  5. An unprovable Ramsey-type theorem
    (M. Löbl, J. Nešetřil) Proc. Amer. Math. Soc. 116 (1992), no. 3, 819 - 82
  6. Simple tournaments and sharply transitive groups
    (W. Imrich, J. Nešetřil) Discrete Math. (1992), no. 108, 159 - 165
  7. Zdeněk Frolík and his Winter Schools
    (J. Nešetřil) In: Topological, algebraical and combinatorial structures, Topics Discrete Math., 8, North-Holland, Amsterdam (1992), pp. IX-X
  8. Topological, algebraical and combinatorial structures
    (editor: J. Nešetřil) Frolík´s memorial volume. Topics in Discrete Mathematics. 8. Amsterdam: North-Holland (1992), p. 404, Reprinted from the Journal of Discrete Mathematics 108, 1-3, 1992
  9. On Ramsey graphs without bipartite subgraphs
    (J. Nešetřil, V. Rödl) Special volume to mark the centennial of Julius Petersen´s "Die Theorie der regulären Graphs", Part II. Discrete Math. 108 (1992), no. 1-3, 223 - 229
  10. The core of a graph
    (P. Hell, J. Nešetřil) Algebraic graph theory (Leibnitz, 1989). Discrete Math. 109 (1992), no. 1-3, 117 - 126
  11. Z. Frolík and his winter schools
    (editor: J. Nešetřil) Topological, algebraical and combinatorial structures. Frolík´s memorial volume. Discrete Math. 108 (1992), no. 1-3
1991
  1. Extendability, dimensions and diagraphs of cyclic orders
    (P. Alles, J. Nešetřil, S. Poljak) SIAM J. Discrete Math. (1991), no. 4, 453 - 471
  2. Images or rigid digraphs
    (P. Hell, J. Nešetřil) European J. Comb. 12 (1991), no. 1, 33 - 42
  3. Fast and slow growing (a combinatorial study of unprovability)
    (M. Löbl, J. Nešetřil) Surveys in combinatorics, 1991 (Guilford, 1991), London Math. Soc. Lecture Note Ser., 166, Cambridge Univ. Press. Cambridge (1991), 119 - 160
  4. Noncrossing subgraphs in topological layouts
    (J. Kratochvíl, A. Lubiw, J. Nešetřil) SIAM J. Discrete Math. 4 (1991), no. 2, 223-244
  5. Czech landscapes (in czech)
    (J. Nešetřil) Ateliér (1991), no. 6, p.9
  6. Reorientation of covering graphs
    (G. R. Brightwell, J. Nešetřil) Combinatorics of ordered sets (Oberwolfach, 1988). Discrete Math. 88 (1991), no. 2-3, 129 - 132
  7. Chromatic number of the Hasse diagrams, eyebrows and dimension
    (I. Kříž, J. Nešetřil) Order (1991), no. 8, 41 - 48
1990
  1. On Pisier type problems and results (combinatorial applications to number theory)
    (P. Erdős, J. Nešetřil, V. Rödl) Mathematics of Ramsey theory, Algorithms Combin., 5, Springer, Berlin (1990), 214 - 231
  2. Complexity of H-colouring
    (P. Hell, J. Nešetřil) J. Comb. Th. B (1990), no. 48, 92 - 110
  3. INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs
    (J. Kratochvíl, J. Nešetřil) Comment. Math. Univ. Carolinae 31 (1990), no. 1, 85 - 93
  4. Mathematics of Ramsey theory
    (editor: J. Nešetřil, V. Rödl) Springer Verlag (1990), p. 269
  5. Minimal uniquely colourable hypergraphs
    (G. Burosch, H. D. Gronau, J. Nešetřil) Contemporary methods in graph theory, Bibliographisches Inst. Mannheim (1990), 195 - 207
  6. Introduction : Ramsey theory old and new
    (J. Nešetřil, V. Rödl) Mathematics of Ramsey theory, Algorithms Combin., 5, Springer, Berlin (1990), 1 - 9
  7. On locally presented posets
    (G. Gambosi, J. Nešetřil, M. Talamo) Theor. Comp. Sci. 70 (1990), no. 2, 251 - 260
  8. Partite construction and Ramsey space systems
    (J. Nešetřil, V. Rödl) Mathematics of Ramsey theory, Algorithms Combin., 5, Springer, Berlin (1990), 98 - 112
1989
  1. Chromatically optimal rigid graphs
    (J. Nešetřil, V. Rödl) J. Comb. Th. B (1989), no. 46, 133 - 141
  2. The existence problem for graph homomorphisms
    (P. Hell, J. Nešetřil) Graph theory in memory of G. A. Dirac (Sandbjerg, 1985), Ann. Discrete Math. 41, North-Holland, Amsterdam - New York (1989), 255 - 265
  3. Universality of directed graphs of a given height
    (P. Hell, J. Nešetřil) Arch. Math., Brno 25 (1989), no. 1-2, 47 - 54
  4. For graphs there are only four types of hereditary Ramsey classes
    (J. Nešetřil) J. Comb. Th. B 46 (1989), no. 2, 127 - 132
  5. Postorder hierarchy for part compressions and set union
    (M. Löbl, J. Nešetřil) Machines, languages, and complexity (Smolenice, 1988), Lecture Notes in Comput. Sci., 381, Springer, Berlin (1989), 146 - 151
  6. The partite construction and Ramsey set systems
    (J. Nešetřil, V. Rödl) Graph theory and combinatorics (Cambridge, 1988). Discrete Math. 75 (1989), no. 1-3, 327 - 334
  7. A note on Boolean dimension of posets
    (J. Nešetřil, P. Pudlák) Irregulartities of partitions (Fertoed, 1986), Algorithms Combin.: Study Res. Texts, 8, Springer, Berlin-New York (1989), 137 - 140
1988
  1. Epidemiography-II: Games with Dozing yet winning player
    (A. Fränkel, M. Löbl, J. Nešetřil) J. Comb. Th. A (1988), no. 49, 129 - 144
  2. On polynomial time decidability of induced minor-closed classes
    (J. Matoušek, J. Nešetřil, R. Thomas) Comment. Math. Univ. Carolinae 29 (1988), no. 4, 703 - 710
  3. Cycles and directed cuts in directed graphs
    (J. Dambitis, J. Nešetřil) Latv. Mat. Ezhegodnik (1988), no. 32, 78 - 84, Russian
  4. The chromatic connectivity of graphs
    (C. D. Godsil, J. Nešetřil, R. Nowakowski) Graphs Combin. 4 (1988), no. 3, 229 - 233
  5. Algebraic methods in discrete mathematics
    (L. Kučera, J. Nešetřil) Státní technické nakladatelství (1988), p. 500, Czech - a monograph
1987
  1. Complexity of Diagrams
    (J. Nešetřil, V. Rödl) Order (1987), no. 3, 321 - 330
  2. Strong Ramsey theorem for Steiner systems
    (J. Nešetřil, V. Rödl) Trans. Amer. Math. Soc. (1987), no. 303, 183 - 192
  3. Local k-colorings of graphs and hypergraphs
    (A. Gyarfás, J. Lehel, J. Nešetřil, R. H. Shelp, Z. Tuza) J. Comb. Th. B (1987), no. 43, 127 - 139
  4. Posets, Boolean representations and quick path searching
    (G. Gambosi, J. Nešetřil, M. Talamo) Automata, languages and programming (Karlsruhe, 1987), Lecture Notes in Comput. Sci., 267, Springer, Berlin-New York (1987), 404 - 424
  5. Cutset triangulated graphs
    (E. Balas, V. Chvátal, J. Nešetřil) Mathematics of Operations Research (1987), no. 12, 522 - 535
  6. Partite construction and Ramseyan theorems for sets, numbers and spaces
    (J. Nešetřil, V. Rödl) Comment. Math. Univ. Carolinae 28 (1987), no. 3, 569 - 580
  7. Efficient representation of taxonomies
    (G. Gambosi, J. Nešetřil, M. Talamo) TAPSOFT'87, Vol 1, Pisa, 1987, Lecture Notes in Comput. Sci. 249, Springer, Berlin-New York (1987), 232 - 240
  8. Well quasi ordering, long games and combinatorial study of undecidability
    (J. Nešetřil, R. Thomas) Contemporary Math., AMS (1987), no. 65, 281 - 293
1986
  1. A Historical perspective of finite mathematics
    (J. Nešetřil) Pokroky mat. fyz. a astronomie (1986), 35 - 43, Czech
  2. Large minimal sets which force long arithmetic progressions
    (R. Graham, J. Nešetřil) J. Comb. Th. A 42 (1986), no. 2, 270 - 276
  3. Finite union theorem with restrictions
    (J. Nešetřil, V. Rödl) Asian J. Graph Th. Comb. (1986), no. 2, 357 - 361
  4. Random graphs and covering graphs of posets
    (B. Bollobás, G. Brightwell, J. Nešetřil) Order (1986), no. 3, 245 - 255
  5. A remark on max-cut problem with an application to digital-analog convertors
    (J. Nešetřil, S. Poljak) Operat. Research Letters (1986), no. 4, 289 - 291
  6. On sets of integers with the Schur property
    (J. Nešetřil, V. Rödl) Graphs Combin. 2 (1986), no. 3, 269 - 275
1985
  1. A note on special representation of graphs
    (J. Nešetřil, R. Thomas) Comment. Math. Univ. Carolinae 26 (1985), no. 4, 655 - 659
  2. Canonizing ordering theorems for Hales Jewett structures
    (J. Nešetřil, H. J. Prömel, V. Rödl, B. Voigt) J. Comb. Th. A 40 (1985), no. 2, 394 - 408
  3. Two proofs from combinatorial number theory
    (J. Nešetřil, V. Rödl) Proc. Amer. Math. Soc. 93 (1985), no. 1, 185 - 188
  4. Epidemiography
    (A. Fränkel, J. Nešetřil) Pacific J. Math. (1985), no. 118, 369 - 381
  5. Complexity of the Subgraph Problem
    (J. Nešetřil, S. Poljak) Comment. Math. Univ. Carolinae 26 (1985), no. 2, 415 - 419
  6. Two remarks on Ramsey theorem
    (J. Nešetřil, V. Rödl) Discrete Math. (1985), no. 54, 339 - 341
  7. Minimal Tests for unique colorability
    (G. Burosch, H. D. Gronau, J. Nešetřil) In: Graphen in Forschung und Unterricht, B. Franzbecker Verlag, Salzdetfurth (1985), 48 - 53
  8. On the use of signal-senders in Generalized Ramsey Theory for Graphs
    (S. Burr, J. Nešetřil, V. Rödl) Discrete Math. (1985), no. 54, 1 - 13
  9. Three remarks on dimensions of graphs
    (J. Nešetřil, V. Rödl) Annals of Discrete Math. (1985), no. 28, 199 - 207
  10. Special amalgams and Ramsey matroids
    (J. Nešetřil, S. Poljak, D. Turzík) In: Coll. Math. Soc. János Bolyai, 40. Matroid Theory Szeged 1982 North Holland (1985), pp. 267 - 298
1984
  1. Some remarks on Ramsey matroids
    (J. Nešetřil, S. Poljak, D. Turzík) In: Proceedings of the 11th Winter School, Supp. Rend. Del Circolo Mat. Palermo II (1984), no. 3, 185 - 189
  2. Combinatorial partitions of finite posets and lattices - Ramsey lattices
    (J. Nešetřil, V. Rödl) Algebra Univ. (1984), no. 19, 106 - 119
  3. Selectivity of hypergraphs
    (P. Erdős, J. Nešetřil, V. Rödl) In: Proceedings of the IV. Hungarian comb. Coll. 1981, Coll. Math. Soc. János Bolyai 37., North Holland (1984), 265 - 284
  4. Sparse Ramsey graphs
    (J. Nešetřil, V. Rödl) Combinatorica 4 (1984), no. 1, 71 - 78
  5. Some nonstandard Ramsey-like applications
    (J. Nešetřil) Theor. Comp. Sci. (1984), no. 34, 3 - 15
  6. Note on canonizing ordering theorems for Hales Jewett structures
    (J. Nešetřil, H. J. Prömel, V. Rödl, B. Voigt) In: Proceedings of the 11th Winter School, Supp. Rend. Del Circolo Mat. Palermo II (1984), no. 3, 191 - 196
1983
  1. On an extremal problem on v-partite graphs
    (J. Nešetřil, R. Paninski, H. Sachs) European J. Comb. (1983), no. 4, 255 - 262
  2. Some problems related to partitions of edges of a graph
    (P. Erdős, J. Nešetřil, V. Rödl) In: Graphs and other Combinatorial Topics, Teubner, Leipzig (1983), 54 - 63
  3. Ramsey classes of set systems
    (J. Nešetřil, V. Rödl) J. Comb. Th. A 34 (1983), no. 2, 183 - 201
  4. The achromatic number of simple hypergraphs
    (J. Nešetřil, K. Phelps, V. Rödl) Ars Combinatorica (1983), no. 16, 95 - 102
  5. Combinatorics I - graphs
    (J. Nešetřil) Státní pedagogické nakladatelství, Prague (1983), p. 200, Czech, Lecture notes
  6. Ramsey varieties
    (J. Ježek, J. Nešetřil) European J. Comb. (1983), no. 4, 143 - 147
  7. Products of graphs and their applications
    (J. Nešetřil, V. Rödl) Proceedings of the Kuratowski Conference, Lecture notes in Mathematics,Springer, 1018 (1983), pp. 151 - 160
  8. Generalized Ramsey Theory XIV.- Induced Ramsey numbers
    (F. Harary, J. Nešetřil, V. Rödl) In: Graphs and other Combinatorial Topics Teubner, Leipzig (1983), 90 - 100
  9. Another proof of Folkman-Rado-Sanders theorem
    (J. Nešetřil, V. Rödl) J. Comb. Th. A 34 (1983), no. 1, 108 - 109
1982
  1. Two proofs of the partition property of set systems
    (J. Nešetřil, V. Rödl) European J. Comb. (1982), no. 3, 347 - 352
  2. A short proof of the existence of restricted Ramsey graphs by means of a partite construction
    (J. Nešetřil, V. Rödl) Combinatorica (1982), no. 1,2, 199 - 202
  3. High chromatic rigid graphs II
    (L. Babai, J. Nešetřil) Annals of Discrete Math. (1982), no. 15, 55 - 61
  4. Canonical ordering theorems - A first attempt
    (J. Nešetřil, H. J. Prömel, V. Rödl, B. Voigt) In: Proceedings of the 10th Winter school, Supplemento di Rendiconti de Circolo Math. di Palermo II (1982), no. 2, pp. 193 - 197
1981
  1. Mathematical models of the optimal distribution in an educational system (Czech)
    (O. Botlík, J. Nešetřil) In: Three chapters from graph theory, Charles Univ. (1981), p. 60, (Czech)
  2. Quotients of rigid graphs
    (M. E. Adams, J. Nešetřil, J. Sichler) J. Comb. Th. B 30 (1981), no. 3, 351 - 359
  3. Amalgamation of matroids and its applications
    (J. Nešetřil, S. Poljak, D. Turzík) J. Comb. Th. B 31 (1981), no. 1, 9 - 22
  4. Representation of graphs by products and their complexity
    (J. Nešetřil) Lecture notes in Computer Science, Springer-Verlag (1981), no. 118, 94 - 102
1980
  1. On a product dimension of a graph
    (L. Lovász, J. Nešetřil, A. Pultr) J. Comb. Th. B (1980), no. 29, 47 - 67
  2. Selected topics from graphs theory
    (J. Nešetřil) Charles Univ. (1980), Czech, Lecture notes
  3. Dual Ramsey type theorems
    (J. Nešetřil, V. Rödl) VIII. Winterschool on Abstract Analysis (editor Z. Frolík), Prague (1980), 121 - 123
  4. Product and other representations of graphs and related characteristics
    (J. Nešetřil, A. Pultr) Algebraic methods of graph Theory, Coll. Math. Soc. János Bolyai 25, North-Holland (1980), 571 - 598
  5. Geometrical and Algebraical connections of combinatorial optimization
    (J. Nešetřil, S. Poljak) Sofsem, VVS Bratislava (1980), no. 80, 35 - 78, Czech
  6. The complexity of dimension there and other covering characteristics of a graph
    (L. Kučera, J. Nešetřil, A. Pultr) Theor. Comp. Sci. (1980), no. 11, 93 - 106
1979
  1. A short proof of the existence of highly chromatic graphs without short cycles
    (J. Nešetřil, V. Rödl) J. Comb. Th. B (1979), no. 27, 225 - 227
  2. Some combinatorial properties of partitions of integers
    (J. Nešetřil, V. Rödl) In: Proceedings of the 4th Czechoslovak Number theoretical Summer School, Čaradice, Bratislava (1979), 7 - 9
  3. Graphs and Trees
    (I. Havel, L. Kučera, J. Nešetřil) In: Sofsem, 79, VVS Bratislava (1979), 109 - 136, Czech
  4. Theory of graphs
    (J. Nešetřil) Státní technické nakladatelství (1979), p. 300, Czech, a monograph
  5. Amalgamation of graphs and its applications
    (J. Nešetřil) Ann. of New York Acad. Sci. (1979), no. 319, 415 - 428
  6. On edge sets of rigid and corigid graphs
    (P. Hell, J. Nešetřil) Math. Nachrichten (1979), no. 87, 63 - 69
  7. Ramsey property of classes of hypergraphs with forbidden complete subhypergraphs
    (J. Nešetřil, V. Rödl) Czechoslovak Math. J. 29 (1979), no. 104, 202 -218
  8. On rigid and corigid graphs
    (P. Hell, J. Nešetřil) Math. Nachrichten (1979), no. 87, 54 -63
  9. A combinatiorial construction - schema
    (J. Nešetřil) Fundamentals of Computation Theory, Academie Verlag, Berlin (1979), 301 - 312
  10. Partition theory and its applications
    (J. Nešetřil, V. Rödl) Surveys in Combinatorics, Cambridge Univ. Press. Cambridge (1979), 96 - 156
  11. Ramsey property of graphs without short odd cycles
    (J. Nešetřil, V. Rödl) CMUC 20 (1979), no. 3, 565 - 582
1978
  1. On classes of relations and graphs determined by subobjects and factorobjects
    (J. Nešetřil, A. Pultr) Discrete Math. (1978), no. 22, 287 - 300
  2. A simple proof of the Galvin-Ramsey property of graphs and a dimension of a graph
    (J. Nešetřil, V. Rödl) Discrete Math. (1978), no. 23, 49 - 55
  3. High chromatic rigid graphs I
    (L. Babai, J. Nešetřil) Colloquia Math. Soc. János Bolyai, 18. Combinatorics, Keszthely (Hung.), 1976, North-Holland (1978), 53 - 60
  4. Partition (Ramsey) theory - a survey
    (J. Nešetřil, V. Rödl) Colloquia Math. Soc. János Bolyai, 18. Combinatorics, Keszthely (Hung.), 1976, North-Holland (1978), 759 - 792
  5. A selective theorem for graphs and hypergraphs
    (J. Nešetřil, V. Rödl) Problemes Combinatoires et Théorie des Graphes, Colloques Internationaux du C.N.R.S., No 260, Editions du C.N.R.S., Paris (1978), 307 - 308
  6. On a selective property of graphs and hypergraphs
    (J. Nešetřil, V. Rödl) Proceedings of the Cambridge Colloquium (1977), Annals of Discrete Math. (1978), no. 3, 181 - 189
  7. A probabilistic graph theoretical method
    (J. Nešetřil, V. Rödl) Proc. Amer. Math. Soc. (1978), no. 72, 417 - 421
  8. On infinite precise objects
    (J. Nešetřil) Math. Slovaca (1978), no. 28, 253 - 260
  9. Combinatorial Constructions, their complexity and practical meaning
    (J. Nešetřil) Pokroky mat. fyz. a astronomie XXIII (1978), no. 1, 16 - 27, Czech
  10. On critical Ramsey graphs
    (J. Nešetřil, V. Rödl) Acta Math. Acad. Sci. Hungar. 32 (1978), no. 3-4, 295 - 300
  11. Homomorphisms of graphs and of their orientations
    (P. Hell, J. Nešetřil) Monatsh. für Math. (1978), no. 85, 39 - 48
  12. The structure of critical Ramsey graphs
    (J. Nešetřil, V. Rödl) Problemes Combinatoires et Théorie des Graphes, Colloques Internationaux du C.N.R.S., No 260, Editions du C.N.R.S., Paris (1978), 309 - 312
1977
  1. A structural generalization of the Ramsey theorem
    (J. Nešetřil, V. Rödl) Bull. Amer. Math. Soc. 83 (1977), no. 1, 127 - 128
  2. Partitions of relational and set systems
    (J. Nešetřil, V. Rödl) J. Comb. Th. A (1977), no. 22, 289 - 312
  3. Some problems concerned with chromatic numbers of graphs and hypergraphs
    (J. Nešetřil, V. Rödl) Beiträge zur graphentheorie und deren Anwendungen, Math. Gesellschaft der DDR, Ilmenau (1977), 189 - 192
  4. Ramsey topological spaces
    (J. Nešetřil, V. Rödl) Proceedings of 4th Prague Toposymposium, 1976, Praha (1977), 333 - 337
  5. Czechoslovak Combinatorial Bulletin
    (editor: J. Nešetřil) Charles Univ. (1977), p. 24
  6. Riga p-point
    (J. Nešetřil) Comment. Math. Univ. Carolinae 18 (1977), no. 4, 675 - 683
  7. A Duschnik - Miller type dimension of graphs and its complexity
    (J. Nešetřil, A. Pultr) Lecture Notes in Computer Science, Springer Verlag (1977), no. 56, 482 - 494
1976
  1. Ramsey characterization theorem for classes of structures II
    (J. Nešetřil, V. Rödl) In: Graphs, Hypergraphs and Block systems, Zieclona Gora conference, Poland (1976), 181 - 186
  2. Complete and pseudocomplete colourings of a graph
    (J. Bosák, J. Nešetřil) Math. Slovaca (1976), no. 26, 171 - 184
  3. Van den Wärden theorem for sequences of integers not containing an arithmetical progression of k terms
    (J. Nešetřil, V. Rödl) Comment. Math. Univ. Carolinae 17 (1976), no. 4, 675 - 682
  4. Ramsey characterization theorem for classes of structures I
    (J. Nešetřil, V. Rödl) In: Graphs, Hypergraphs and Block systems, Zieclona Gora conference, Poland (1976), 173 - 179
  5. Some distribution problems solved by means of graphs theory
    (J. Nešetřil) In: Numericke metody a teoria grafov, CTVS - Dom techniky Kosice (1976), 122 - 131, Czech
  6. Partition (Ramsey) theory - a survey
    (J. Nešetřil, V. Rödl) Pamphlet 3 (1976), 1-20, mimeo Charles Univ.
  7. Ramsey property of graphs with forbidden complete subgraphs
    (J. Nešetřil, V. Rödl) J. Comb. Th. B (1976), no. 20, 243 - 249
  8. Partitions of vertices
    (J. Nešetřil, V. Rödl) Comment. Math. Univ. Carolinae 17 (1976), no. 1, 85 - 95
1975
  1. A ramsey graph without triangles exists for any graph without triangles
    (J. Nešetřil, V. Rödl) In: Coll. Math. Soc. Janos Bolyai, 10, Infinite and Finite sets, Keszthely (1973), North-Holland (1975), 1127 - 1132
  2. Partitions of subgraphs
    (J. Nešetřil, V. Rödl) In: Recent advances in graph theory (editor M. Fiedler) Academia Prague (1975), 413 - 423
  3. Partitions of societies
    (J. Nešetřil) MFF Charles Univ. (1975), dissertation, Czech
  4. Combinatorics
    (J. Nešetřil) Státní pedagogické nakladatelství, Praha (1975), p. 160, Czech, lecture notes
  5. Type theory of partition properties of graphs
    (J. Nešetřil, V. Rödl) In: Recent advances in graph theory (editor M. Fiedler), Academia Prague (1975), 405 - 412
  6. Either tournaments of algebras
    (V. Müller, J. Nešetřil, J. Pelant) Discrete Math. (1975), no. 11, 37 - 66
1974
  1. Representing of groups and semigroups by products in categories of relations
    (V. Koubek, J. Nešetřil, V. Rödl) Algebra Univ. 4 (1974), no. 3, 336 - 341
  2. Extension of full Ramsey theorem in categories of graphs and relations
    (J. Nešetřil, V. Rödl) Pamphlet 2 (1974), 1-42, mimeo Charles Univ.
1973
  1. Groups and monoids of regular graphs and of graphs with bounded degrees
    (P. Hell, J. Nešetřil) Canad. J. Math. XXV (1973), no. 2, 239 - 251
  2. The Ramsey property of the categories of graphs with forbidden complete subgraphs
    (J. Nešetřil, V. Rödl) Pamphlet 1 (1973), 1-15, mimeo Charles Univ.
  3. On approximative isomorphisms and the Ulam-Kelly conjecture
    (J. Nešetřil) In: Bericht der XVIII, IWK, TH Ilmenau (1973), 17 - 18
  4. On uniquelly colorable graphs without short cycles
    (J. Nešetřil) Časopis pro pěstování matematiky (1973), no. 98, 122 - 125
1972
  1. Either tournaments or algebras
    (V. Müller, J. Nešetřil, J. Pelant) Comment. Math. Univ. Carolinae 13 (1972), no. 4, 801 - 807
  2. On critical uniquelly colorable graphs
    (J. Nešetřil) Archiv der Math. XXIII (1972), no. 2, 210 - 213
  3. On symmetric and antisymmetric relations
    (J. Nešetřil) Monatsh. Für Math. (1972), no. 76, 323 - 327
  4. A remark on Kirkman's school girls problem
    (J. Nešetřil, H. Nešetřilová) Dějiny vědy a techniky (1972), no. 5, 171 - 173, Czech + English abstract
  5. On reconstructing of infinite forests
    (J. Nešetřil) Comment. Math. Univ. Carolinae 13 (1972), no. 3, 503 - 510
1971
  1. Every finite graph is a full subgraphs of a rigid graph
    (J. Chvátal, P. Hell, L. Kučera, J. Nešetřil) J. Comb. Th. 11 (1971), no. 3, 284 - 286
  2. Homomorphism of derivative graphs
    (J. Nešetřil) Discrete Math. 1 (1971), no. 3, 257 - 268
  3. Every group is a maximal subgroup of the semigroup of relations
    (J. Nešetřil) Comment. Math. Univ. Carolinae 12 (1971), no. 1, 19 - 21
  4. A congruence theorem for asymmetric trees
    (J. Nešetřil) Pacific J. Math. 37 (1971), no. 3, 771 - 778
  5. Representing monoids by mappings preserving equivalences
    (J. Nešetřil, A. Pultr) Algebra Univ. 1 (1971), no. 2, 155 - 162
1970
  1. K-societies with given semigroup
    (P. Hell, J. Nešetřil) In: Combinatorial structures and their applications. Gordon Breach, New York, London, Paris (1970), 301 - 302
  2. Graphs with small asymetries
    (J. Nešetřil) Comment. Math. Univ. Carolinae 11 (1970), no. 3, 403 - 419
  3. Graphs and K-Societies
    (P. Hell, J. Nešetřil) Canad. Math. Bull. 13 (1970), no. 3, 375 - 381
  4. Rigid and inverse rigid graphs
    (P. Hell, J. Nešetřil) In: Combinatorial structures and their applications. Gordon Breach, New York, London, Paris (1970), 169 - 171
1966
  1. K-chromatic graphs without cycles of length <7
    (J. Nešetřil) Comment. Math. Univ. Carolinae 7 (1966), no. 3, 373 - 376, in Russian