Neighbor designs and m-wheel systems

DOI10.1016/0378-3758(91)90046-HzbMath0716.62072MaRDI QIDQ753362

C. A. Rodger, Charles C. Lindner, Charles J. Colbourn

Publication date: 1991

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

cyclesregular decompositionedge disjoint copiesm-wheel systemsneighbor designs

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Other designs, configurations (05B30)

Related Items (1)

All graphs with maximum degree three whose complements have 4-cycle decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nesting of cycle systems of odd length
• Steiner pentagon systems
• The spectrum for 2-perfect 6-cycle systems
• Neighbor designs
• Constructions for some classes of neighbor designs
• On the construction of odd cycle systems
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

This page was built for publication: Neighbor designs and m-wheel systems