Combinatorial designs and related computational constructions

DOI10.1017/S0004972700017299zbMATH Open0879.05047MaRDI QIDQ4350833FDOQ4350833

Authors: P. Adams 

Publication date: 19 October 1997

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

Recommendations

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

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)

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
• Title not available (Why is that?)
• On compressing complete designs
• Title not available (Why is that?)
• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)

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)