Block Intersections in Quasi-Residual Designs.
Block Intersections in Quasi-Residual Designs. (Short Communication).
Blocking sets of 16 points in projective planes of order 10 - III
Blocking sets of maximal type in finite projective planes
Boundary of the union of rectangles in the plane
Given rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.
Bounding the Rank of Certain Permutation Groups.
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Characterisation of some sparse binary sequential arrays.
Characterisation of Some Steiner Systems, Parallelisms, and Biplanes.
Characterizations of transversal and fundamental transversal matroids.
Chohomological Aspects of Two-Graphs.
Chromatic Number And The Spectrum Of A Graph
Circle-packing connections with random walks and a finite volume method
Circuit and cocircuit partitions of binary matroids
We give an example of a class of binary matroids with a cocircuit partition and we give some characteristics of a set of cocircuits of such binary matroids which forms a partition of the ground set.
Circulants and the chromatic index of Steiner triple systems
Classification of flocks of the quadratic cone over fields of order at most 29.
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant...
Classification of the Steiner quadruple systems of cardinality 32
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.