Almost self-complementary factors of complete bipartite graphs

From MaRDI portal





It is proved that the graph \(K_{2n+1,2m+1}\) minus one edge can be decomposed into two isomorphic factors with a given diameter \(d\) only if \(3\leq d\leq 6\) or if \(d=\infty\); in each case the decomposable graphs are completely characterized. Moreover, for \(d=\infty\) all classes of possible disconnected factors are determined.











This page was built for publication: Almost self-complementary factors of complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356470)