Meszka, Mariusz; Skupień, Zdzisław On some third parts of nearly complete digraphs. (English) Zbl 0940.05054 Discrete Math. 212, No. 1-2, 129-139 (2000). The authors proceed with their investigation of third and near-third parts of complete digraphs [see Combinatorica 18, No. 3, 413-424 (1998; Zbl 0924.05052)]. Neat new results concerning mainly the complete digraphs with \(5\) and with \(9+6k\), \(k\in\{0,1,\dots \}\) vertices are presented. Also an outline of an algorithm to find the \(t\)th parts of a digraph is included. Parts are asked to be self-converse or to have (or not to have) a couple of symmetric arcs. The backtracking method is applied. Reviewer: M.Harminc (Košice) MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C20 Directed graphs (digraphs), tournaments Keywords:line decomposition; digraph; graph; multigraph; isomorphic parts Citations:Zbl 0924.05052 PDFBibTeX XMLCite \textit{M. Meszka} and \textit{Z. Skupień}, Discrete Math. 212, No. 1--2, 129--139 (2000; Zbl 0940.05054) Full Text: DOI