Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
- 1 February 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 30 (1) , 75-81
- https://doi.org/10.1016/0095-8956(81)90093-9
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Decomposition of the complete directed graph into k-circuitsJournal of Combinatorial Theory, Series B, 1976