On P-quasigroups and decompositions of complete undirected graphs

DOI10.1016/0095-8956(72)90063-9zbMath0231.05108OpenAlexW2043721650MaRDI QIDQ2550403

A. D. Keedwell, József Dénes

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90063-9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Loops, quasigroups (20N05)

Related Items (6)

Critical sets in nets and Latin squares ⋮ Free medial quandles ⋮ Quasigroups defining Eulerian paths in complete graphs ⋮ Row complete squares and a problem of A. Kotzig concerning P-quasigroups and Eulerian circuits ⋮ Further results concerning P-quasigroups and complete graph decompositions ⋮ Construction of n-cyclic quasi-groups and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On P-quasigroups and decompositions of complete undirected graphs