Hell, Pavol; Nešetřil, Jaroslav Universality of directed graphs of a given height. (English) Zbl 0712.05033 Arch. Math., Brno 25, No. 1-2, 47-54 (1989). For two directed graphs G and H let us write \(G\to H\) or \(G\mapsto H\) according as there does or does not exist a homomorphism from G into H; and, for any directed graph A let \(\to A=\{G: G\to A\}\) and \(A\mapsto =\{G: A\mapsto G\}.\) The authors characterize the graphs A such at the classes \(\to A\) and \(A\mapsto\) are universal. Reviewer: J.W.Moon Cited in 1 Document MSC: 05C20 Directed graphs (digraphs), tournaments Keywords:directed graphs; homomorphism PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Arch. Math., Brno 25, No. 1--2, 47--54 (1989; Zbl 0712.05033) Full Text: EuDML