4-cycle Decompositions of the Cartesian Product of Two Complete Graphs

@inproceedings{PikeyDepartment20074cycleDO,
  title={4-cycle Decompositions of the Cartesian Product of Two Complete Graphs},
  author={David A. PikeyDepartment},
  year={2007}
}
  • David A. PikeyDepartment
  • Published 2007
In this paper we establish necessary and suucient conditions on m and n in order for KmKn, the cartesian product of two complete graphs, to be decomposable into cycles of length 4. The main result is that Km Kn can be decomposed into cycles of length 4 if and only if either m; n 0 (mod 2), m; n 1 (mod 8), or m; n 5 (mod 8). 

Figures from this paper.

Citations

Publications citing this paper.

Decomposition of Product Graphs into Paths and Cycles of Length Four

  • Graphs and Combinatorics
  • 2016
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k

  • J. Comb. Theory, Ser. B
  • 1981
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Decompositions into Cycles II: Cycle Systems

C. C. Lindner, C. A. Rodger
  • Contemporary Design Theory: A Collection of Surveys , edited by J.H. Dinitz and D.R. Stinson, John Wiley & Sons, New York
  • 1992
VIEW 1 EXCERPT

Packing Complete Graphs with Squares, Bulletin of the ICA

D. G. Ho man, W. D. Wallis
  • 1991
VIEW 2 EXCERPTS