Highly Influenced

# Almost self-complementary factors of complete bipartite graphs

@article{Froncek1997AlmostSF, title={Almost self-complementary factors of complete bipartite graphs}, author={Dalibor Froncek}, journal={Discrete Mathematics}, year={1997}, volume={167-168}, pages={317-327} }

- Published 1997 in Discrete Mathematics
DOI:10.1016/S0012-365X(96)00237-3

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. AMS classification… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references