Almost self-complementary factors of complete bipartite graphs

  title={Almost self-complementary factors of complete bipartite graphs},
  author={Dalibor Froncek},
  journal={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. AMS classification… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-8 of 8 references

Almost self-complementary graphs I

  • P. K. Das
  • Ars Combin. 31
  • 1991
1 Excerpt

Isomorphic factorizations of complete graphs into factors with a given diameter

  • P. Hic, D. Palumbiny
  • Math. Slovaca 37
  • 1987
1 Excerpt

Range of diameters in a graph and its r-partite complement

  • T. Gangopadhyay
  • Ars Combm 18
  • 1983
1 Excerpt

Factorizations of complete graphs into isomorphic factors with a given diameter

  • D. Palumbiny
  • Zbomik Pedagogickej Fakulty v Nitre, Matematika 2
  • 1982
1 Excerpt


  • M. Behzad
  • Chartrand and L. Lesniak-Foster, Graphs and…
  • 1979

Decomposition of complete bipartite graphs into factors with given diameters

  • E. Tomovfi
  • Math. Slovaca 27
  • 1977
2 Excerpts

Decompositions of graphs and hypergraphs into isomorphic t;actors with a given diameter

  • P. Tomasta
  • Czechoslovak Math. J. 27
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…