The following pages link to Jaroslav Nešetřil (Q175596):
Displayed 50 items.
- On the complexity of H-coloring (Q1100215) (← links)
- Epidemiography. II: Games with a dozing yet winning player (Q1106113) (← links)
- Finite union theorem with restrictions (Q1106223) (← links)
- The chromatic connectivity of graphs (Q1110536) (← links)
- The partite construction and Ramsey set systems (Q1119640) (← links)
- Chromatically optimal rigid graphs (Q1123199) (← links)
- On a product dimension of graphs (Q1142231) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- Amalgamation of matroids and its applications (Q1158433) (← links)
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (Q1167185) (← links)
- Reorientations of covering graphs (Q1176721) (← links)
- Chromatic number of Hasse diagrams, eyebrows and dimension (Q1182040) (← links)
- On Ramsey graphs without bipartite subgraphs (Q1197030) (← links)
- Simple tournaments and sharply transitive groups (Q1201246) (← links)
- Minimal asymmetric graphs of induced length 4 (Q1205345) (← links)
- Either tournaments or algebras? (Q1215638) (← links)
- Representing groups and semigroups by products in categories of relations (Q1216446) (← links)
- The Ramsey property for graphs with forbidden complete subgraphs (Q1227013) (← links)
- Partitions of finite relational and set systems (Q1239324) (← links)
- Homomorphisms of graphs and of their orientations (Q1245971) (← links)
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph (Q1250115) (← links)
- On classes of relations and graphs determined by subobjects and factorobjects (Q1250117) (← links)
- A short proof of the existence of highly chromatic hypergraphs without short cycles (Q1260043) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- On the maximum average degree and the oriented chromatic number of a graph (Q1304809) (← links)
- Complexity of diagrams (Q1316621) (← links)
- Corrigendum to: `Complexity of diagrams' (Q1319087) (← links)
- On ordered graphs and graph orderings (Q1329810) (← links)
- Colouring relatives of intervals on the plane. II: Intervals and rays in two directions (Q1348767) (← links)
- (Q1356773) (redirect page) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth (Q1378297) (← links)
- A Ramsey property of order types (Q1380338) (← links)
- On the order of countable graphs (Q1404996) (← links)
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) (Q1417575) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- On covers of graphs (Q1422433) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Universal \(H\)-colorable graphs without a given configuration (Q1613451) (← links)
- A Ramsey class for Steiner systems (Q1679333) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Statistics of orderings (Q1688273) (← links)
- Ramsey theorem for designs (Q1689983) (← links)
- Universal partial order represented by means of oriented trees and other simple graphs (Q1775038) (← links)
- Graph-indexed random walks on pseudotrees (Q1792112) (← links)
- For graphs there are only four types of hereditary Ramsey classes (Q1812632) (← links)
- On sets of integers with the Schur property (Q1821785) (← links)
- Another proof of the Folkman-Rado-Sanders theorem (Q1835931) (← links)