Hell, Pavol; Rafiey, Arash The dichotomy of list homomorphisms for digraphs. (English) Zbl 1376.68067 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703-1713 (2011). Cited in 17 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 05C20 Directed graphs (digraphs), tournaments 68P05 Data structures 68R10 Graph theory (including graph drawing) in computer science PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Rafiey}, in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703--1713 (2011; Zbl 1376.68067) Full Text: Link