Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diam\-eter (Q2495512)

An almost complete tripartite graph is obtained by removing one edge from a complete tripartite graph. It is called \(d\)-halvable if it can be decomposed into two isomorphic factors of diameter \(d\). A complete classification is given for all 4-halvable almost complete tripartite graphs of even order in which the missing edge has one endpoint in the partite set of even size and of all 4-halvable almost complete tripartite graphs of odd order. This together with the reviewer's previous results [Discrete Math. 236, 111--122 (2001; Zbl 0998.05051)] gives a complete classification of all 4-halvable almost complete tripartite graphs. Moreover, partial classification of 3-halvable and 5-halvable almost complete tripartite graphs is presented.