Neighbor designs
From MaRDI portal
Publication:1257019
DOI10.1016/0097-3165(77)90021-8zbMath0405.05017OpenAlexW4210770837MaRDI QIDQ1257019
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(77)90021-8
Related Items
A note on varieties of groupoids arising from \(m\)-cycle systems, Partitionable perfect cycle systems with cycle lengths 6 and 8, Decomposing complete equipartite graphs into closed trails of length \(k\), Families of proper generalized neighbor designs, Universally optimal designs under an interference model with equal left- and right-neighbor effects, Difference systems, graph designs, and coloring problems, Construction of neighbor balanced block designs, Universally optimal designs under interference models with and without block effects, Decompositions of \(\lambda K_v\), 2-perfect \(m\)-cycle systems, A decomposition of (λK υ)+ with extended triangles, Distribution of integers into k-tuples with prescribed conditions, Neighbor designs and m-wheel systems, Circular neighbor-balanced designs using cyclic shifts, Designs with partial neighbour balance
Cites Work
- Unnamed Item
- Unnamed Item
- Another class of balanced graph designs: Balanced circuit designs
- Construction of 2-balanced \((n,k,\lambda)\) arrays
- Distribution of integers into k-tuples with prescribed conditions
- Parallel concepts in graph theory
- A direct method to construct triple systems
- Constructions for some classes of neighbor designs
- A Note on Certain Types of Bibd's Balanced for Residual Effects
- A Note on Balanced Incomplete Block Designs
