Abstract
A complete list consisting of 288 nonisomorphic pentagonal 3-packings into the graph K11 is obtained. Some problems are formulated that can be solved with the help of this list.
Similar content being viewed by others
References
J.-C. Bermond, C. Huang, A. Rosa, and D. Sotteau, “Decomposition of complete graphs into isomorphic subgraphs with five vertices,” Ars combinatoria, No. 10, 211–254 (1980).
C. C. Lindner and D. R. Stinson, “Steiner pentagon systems,” Discret. Math.,52, No. 1, 67–74 (1984).
A. Rosa, “Maximal partial designs and configurations,” Le Matematiche,XLV, No. 1, 149–162 (1990).
A. Ya. Petrenyuk, “Enumeration of decompositions of the graph K17 into wheels W4,” in: Nauk. Zap. KDPU, Sen Fiz. Mat. Nauk, Kirovograd (1998), pp. 56–61.
Author information
Authors and Affiliations
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 72–78, November–December, 1999.
Rights and permissions
About this article
Cite this article
Petrenyuk, A.Y. Enumeration of small nonisomorphic pentagonal packings. Cybern Syst Anal 35, 903–909 (1999). https://doi.org/10.1007/BF02742282
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742282