Self-complementary factors of almost complete tripartite graphs of even order (Q5959095)

An almost complete tripartite graph \(k_{a,b,c}\) is a complete tripartite graph without one edge. The graph \(k_{a,b,c}\) is called \(d\)-halvable if it can be decomposed into two isomorphic factors with a given diameter \(d\). The author proves that if the graph \(k_{a,b,c}\) is \(d\)-halvable for a finite \(d\), then \(d\leq 5\). Also, all triples \(a\), \(b\), \(c\) with an even sum are determined for which a \(d\)-halvable almost complete bipartite graph \(k_{a,b,c}\) where \(d= 3\), \(4\), or \(5\) exists.