Decompositions of Complete Graphs Defined by Quasigroups

DOI10.1016/S0304-0208(08)73503-5zbMath0494.05048OpenAlexW1274100112MaRDI QIDQ3956985

Donald Keedwell

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73503-5

zbMATH Keywords

graph decompositionidempotent quasigroupP-groupoidP-quasigroupuniform P-circuit design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Loops, quasigroups (20N05) Triple systems (05B07)

Related Items (3)

Strongly 2-perfect cycle systems and their quasigroups ⋮ A connection between varieties of quasigroups and graph decompositions ⋮ Edge partitions of the complete symmetric directed graph and related designs

This page was built for publication: Decompositions of Complete Graphs Defined by Quasigroups