Balanced colourings of strongly regular graphs

DOI10.1016/j.disc.2004.08.022zbMath1062.05146MaRDI QIDQ1779485

R. A. Bailey

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.022

zbMATH Keywords

Association scheme; Balanced incomplete block design; Balanced design

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05E30: Association schemes, strongly regular graphs

Related Items

A NEW APPROACH TO THE VERTEX COLORING PROBLEM

Cites Work

• Orthogonal partitions in designed experiments
• Optimality and construction of nested row and column designs
• Optimum balanced block and Latin square designs for correlated observations
• Balance in designed experiments with orthogonal block structure
• Some constructions for balanced incomplete block designs with nested rows and columns
• On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
• Some methods of construction of balanced incomplete block designs with nested rows and columns
• Block designs with nested rows and columns
• The analysis of randomized experiments with orthogonal block structure. I. Block structure and the null analysis of variance
• Nested balanced incomplete block designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item