A family of perfect factorisations of complete bipartite graphs

Journal of Combinatorial Theory. Series A

Volumn 98, Issue 2, 2002, Pages 328-342

  Bryant, Darryn ^a   Maenhaut, Barbara M ^b   Wanless, Ian M ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b OPEN UNIVERSITY   (United Kingdom)

^c CHRIST CHURCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036264510     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2001.3240     Document Type: Article

References (12)

1. Hamiltonian-connected self-complementary graphs
2. "On Strongly Hamiltonian Abelian Group Graphs"
3. * using MacMahon's double partition idea
4. Latin squares: New developments in the theory and applications
5. Proper loops of order n in which each non-identity element has left order n
6. Strongly Hamiltonian graphs
7. On strongly Hamiltonian complete bipartite graphs
8. On maximal circuits in directed graphs
9. Some new non-cyclic Latin squares that have cyclic and Youden properties
10. Perfect one-factorizations of the complete graph - A survey
11. One-factorizations
12. Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles