The number of minimally connected block designs

DOI10.1016/0167-9473(86)90007-1zbMath0603.62083OpenAlexW2027389896MaRDI QIDQ1082758

Yadolah Dodge, David S. Birkes

Publication date: 1986

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(86)90007-1

zbMATH Keywords

labeled bicolored treesminimally connected block designs

Mathematics Subject Classification ID

Trees (05C05) Statistical block designs (62K10)

Related Items (1)

Classification of minimally connected \(2^ 3\) factorial experiments

Cites Work

• Spanning sets for estimable contrasts in classification models
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of minimally connected block designs