Combinatorial designs and related computational constructions

DOI10.1017/S0004972700017299MaRDI QIDQ4350833zbMATH OpenFDO

Authors P. Adams

Publication date 19 October 1997

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Petersen graphcycle decompositionsHeawood graphspectrum problembowtiesperfect cycle systems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Other designs, configurations (05B30) Paths and cycles (05C38)

Recommendations

• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)
• Publication:4862227
• scientific article; zbMATH DE number 91008

Cites work

• Steiner pentagon systems
• The spectrum for 2-perfect bowtie systems

Cited in

(6)

• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• A feasibility approach for constructing combinatorial designs of circulant type
• scientific article; zbMATH DE number 193109 (Why is no real title available?)
• On compressing complete designs
• scientific article; zbMATH DE number 3948279 (Why is no real title available?)
• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)

Describes a project that uses

Uses Software

• autogen

This page was built for publication: Combinatorial designs and related computational constructions

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