Abstract
A pair of orthogonal one-factorizations and of the complete graph is totally -free, if the union , for any , does not include a cycle of length four. In this note, we prove if (mod 4) is a prime power with , then there is a pair of orthogonal totally -free one-factorizations of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.