A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Almost self-complementary factors of complete bipartite graphs
1997
Discrete Mathematics
A complete bipartite graph without one edge, IKn, m, is called almost complete bipartite graph. A graph /~2n+l,2m+l that can be decomposed into two isomorphic factors with a given diameter d is called d-isodecomposable. We prove that/~zn+l, 2"+1 is d-isodecomposable only if d = 3, 4, 5, 6 or oo and completely determine all d-isodecomposable almost complete bipartite graphs for each diameter. For d = oo we, moreover, present all classes of possible disconnected factors. A factor F of a graph G =
doi:10.1016/s0012-365x(96)00237-3
fatcat:o5ndnts2efdsvnky6u52hqcprm