Yeo, Anders A polynomial time algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph. (English) Zbl 0946.68105 J. Algorithms 33, No. 1, 124-139 (1999). MSC: 68R10 68N01 05C70 05C85 PDFBibTeX XMLCite \textit{A. Yeo}, J. Algorithms 33, No. 1, 124--139 (1999; Zbl 0946.68105) Full Text: DOI Link
Galluccio, Anna; Loebl, Martin Even directed cycles in \(H\)-free digraphs. (English) Zbl 0919.68091 J. Algorithms 27, No. 1, 26-41 (1998). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{A. Galluccio} and \textit{M. Loebl}, J. Algorithms 27, No. 1, 26--41 (1998; Zbl 0919.68091) Full Text: DOI
Zhu, Xuding A polynomial algorithm for homomorphisms to oriented cycles. (English) Zbl 0836.68089 J. Algorithms 19, No. 3, 333-345 (1995). MSC: 68R10 68Q25 05C20 05C38 PDFBibTeX XMLCite \textit{X. Zhu}, J. Algorithms 19, No. 3, 333--345 (1995; Zbl 0836.68089) Full Text: DOI
Thomassen, Carsten The even cycle problem for planar digraphs. (English) Zbl 0784.68045 J. Algorithms 15, No. 1, 61-75 (1993). MSC: 68Q25 68R10 05C20 PDFBibTeX XMLCite \textit{C. Thomassen}, J. Algorithms 15, No. 1, 61--75 (1993; Zbl 0784.68045) Full Text: DOI
Avery, Peter An algorithmic proof that semiorders are representable. (English) Zbl 0766.06001 J. Algorithms 13, No. 1, 144-147 (1992). MSC: 06A06 05C20 68Q25 PDFBibTeX XMLCite \textit{P. Avery}, J. Algorithms 13, No. 1, 144--147 (1992; Zbl 0766.06001) Full Text: DOI