The Analysis of Directed Triple Systems by Refinement

DOI10.1016/S0304-0208(08)73256-0MaRDI QIDQ3958475zbMATH OpenOpenAlexFDO

Authors Marlene J. Colbourn, Charles J. Colbourn

Publication date 1982

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

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

zbMATH Keywords

decompositionisomorphism testingprinciple of refinementtransitive tournaments

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Triple systems (05B07) Other designs, configurations (05B30) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(7)

• Smallest defining sets of directed triple systems
• Mendelsohn directed triple systems
• A communication problem and directed triple systems
• The spectrum of bicyclic antiautomorphisms of directed triple systems
• Types of directed triple systems
• Cyclic and rotational hybrid triple systems
• Cyclic and rotational hybrid triple systems

This page was built for publication: The Analysis of Directed Triple Systems by Refinement

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