A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that K̃m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.
|Original language||English (US)|
|Number of pages||15|
|State||Published - May 1 2000|
- Graph decompositions
- Isomorphic factors
- Self-complementary graphs