Skip to main content
Log in

Enumeration of small nonisomorphic pentagonal packings

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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).

  2. C. C. Lindner and D. R. Stinson, “Steiner pentagon systems,” Discret. Math.,52, No. 1, 67–74 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Rosa, “Maximal partial designs and configurations,” Le Matematiche,XLV, No. 1, 149–162 (1990).

    MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 72–78, November–December, 1999.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02742282

Keywords

Navigation