On P-quasigroups and decompositions of complete undirected graphs

DOI10.1016/0095-8956(72)90063-9zbMATH Open0231.05108OpenAlexW2043721650MaRDI QIDQ2550403FDOQ2550403

Authors: József Dénes, Anthony Donald Keedwell 

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Critical sets in nets and Latin squares
• 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
• Free medial quandles
• Construction of n-cyclic quasi-groups and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2550403)