Journal of Combinatorial Designs

Papers
(The median citation count of Journal of Combinatorial Designs is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)
ArticleCitations
Perfect 2‐colorings of Hamming graphs7
On flag‐transitive imprimitive 2‐designs7
Evasive subspaces7
Graph decompositions in projective geometries6
The extended binary quadratic residue code of length 42 holds a 3‐design6
The localization number of designs6
On flag‐transitive 2‐(k2,k,λ) $({k}^{2},k,\lambda )$ designs with λ∣k $\lambda | k$6
Further results on large sets of partitioned incomplete Latin squares5
On an Assmus–Mattson type theorem for type I and even formally self‐dual codes5
Plateaued functions on finite abelian groups and partial geometric difference sets4
Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length4
Row‐column factorial designs with multiple levels4
A note on tight projective 2‐designs4
Legendre pairs of lengths ℓ≡0(mod3)3
Group divisible designs with block size 4 and group sizes 2 and 53
Block‐avoiding point sequencings3
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions3
P℘N functions, complete mappings and quasigroup difference sets3
Decomposable super‐simple BIBDs with block size 4 and index 4, 63
Reconfiguration of subspace partitions3
Sparse Steiner triple systems of order 213
Edge balanced star‐hypergraph designs and vertex colorings of path designs3
Quasimagic rectangles2
Small Latin arrays have a near transversal2
Weak sequenceability in cyclic groups2
Extended near Skolem sequences Part II2
Extended near Skolem sequences Part I2
Exceptional designs in some extended quadratic residue codes2
On symmetric designs with flag‐transitive and point‐quasiprimitive automorphism groups2
Existence of strong difference families and constructions for eight new 2‐designs2
Difference matrices with four rows over generalized dihedral groups2
Infinite families of 2‐designs derived from affine‐invariant codes2
Geometric dual and sum‐rank minimal codes2
Tight globally simple nonzero sum Heffter arrays and biembeddings2
Enumeration of Latin squares with conjugate symmetry2
Reduction for flag‐transitive 2‐(v,k,λ) designs with (r,λ)=22
Classification of minimal blocking sets in small Desarguesian projective planes2
Pentagonal geometries with block sizes 3, 4, and 52
Moufang sets generated by translations in unitals2
The existence of irrational most perfect magic squares2
Enumerating Steiner triple systems1
Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum1
Block‐transitive automorphism groups of 2‐(v,k,λ) $(v,k,\lambda )$ designs with (r,k)=1 $(r,k)=1$1
Algorithms and complexity for counting configurations in Steiner triple systems1
Primitive cycle decompositions of Kn and Kn−I1
Generalized pentagonal geometries1
Classification of divisible design graphs with at most 39 vertices1
Universal p‐ary designs1
Partial geometric designs with block sizes three and four1
The spectrum for large sets of resolvable idempotent Latin squares1
New results on large sets of orthogonal arrays and orthogonal arrays1
Corrigendum: Super‐simple resolvable balanced incomplete block designs with block size 4 and index 21
Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes1
The existence of r‐golf designs1
Magic partially filled arrays on abelian groups1
Embedding in MDS codes and Latin cubes1
More constructions for Sperner partition systems1
Self‐dual association schemes, fusions of Hamming schemes, and partial geometric designs1
A sufficient condition for a quandle to be Latin1
Orthogonal cycle systems with cycle length less than 101
A note on magic rectangle set MRSΓ(2k+1,4;4l+2)1
Dual incidences and t‐designs in vector spaces1
On a relation between bipartite biregular cages, block designs and generalized polygons1
Reduction for flag‐transitive point‐primitive 2‐(v, k, λ) designs with λ prime1
Extended near Skolem sequences, Part III1
Partial geometric designs having circulant concurrence matrices1
A generalization of group divisible t $t$‐designs1
On a pair of orthogonal large sets of partitioned incomplete Latin squares1
Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment1
Multifold 1‐perfect codes1
Quaternary complex Hadamard matrices of order 181
Completing the spectrum of semiframes with block size three1
The Oberwolfach problem with loving couples0
0
Issue Information0
Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$0
An update on the existence of Kirkman triple systems with steiner triple systems as subdesigns0
Ordered covering arrays and upper bounds on covering codes0
An explicit construction for large sets of infinite dimensional q $q$‐Steiner systems0
Nestings of BIBDs with block size four0
Issue Information0
An alternative construction of the Hermitian unital 2‐(28, 4, 1) design0
On products of strong Skolem starters0
Sporadic simple groups as flag‐transitive automorphism groups of symmetric designs0
Issue Information0
Genuinely nonabelian partial difference sets0
Well‐balanced quadruple systems0
Cycles of quadratic Latin squares and antiperfect 1‐factorisations0
Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods0
Issue Information0
0
Issue Information0
Issue Information0
Issue Information0
Issue Information0
Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited0
Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces0
0
New infinite classes of 2‐chromatic Steiner quadruple systems0
0
0
The existence of partitioned balanced tournament designs0
0
Issue Information0
0
0
0
On the chromatic number of some generalized Kneser graphs0
The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 600
0
Issue Information0
0
Generalised evasive subspaces0
0
0
Steiner triple systems and spreading sets in projective spaces0
Issue Information0
Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG(3,q) $(3,q)$0
Latin squares from multiplication tables0
Vertex‐regular 1‐factorizations in infinite graphs0
0
0
0
On optimal (Z6m×Z6n,4,1) and (Z2m×Z18n,4,1) difference packings and their related codes0
0
Issue Information0
Maximal partial Room squares0
0
Projective planes of order 12 do not have a collineation group of order 40
Issue Information0
On equitably 2‐colourable odd cycle decompositions0
Doubly sequenceable groups0
Zarankiewicz numbers near the triple system threshold0
Issue Information0
On intriguing sets in five classes of strongly regular graphs0
0
Partition of ordered triples into uniform holey ordered designs0
Issue Information0
Anti‐Pasch optimal coverings with triples0
Completely reducible super‐simple (v,4,4) $(v,4,4)$‐BIBDs and related constant weight codes0
Issue Information0
Towards the Ryser–Woodall λ $\lambda $‐design conjecture0
Issue Information0
Issue Information0
Partial orthomorphisms and Latin squares based on parts of a group0
Infinite series of 3‐designs in the extended quadratic residue code0
Issue Information0
Partitioning the projective plane into two incidence‐rich parts0
Generalizations of some Nordhaus–Gaddum‐type results on spectral radius0
0
Issue Information0
Sailing league problems0
Issue Information0
Issue Information0
On planar arcs of size (q+3)∕20
Issue Information0
Block‐transitive triple systems with sporadic or alternating socle0
0
0
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles0
Issue Information0
Issue Information0
0
0
0
Mutual incidence matrix of two balanced incomplete block designs0
Every latin hypercube of order 5 has transversals0
0
Incidence‐free sets and edge domination in incidence graphs0
Issue Information0
Issue Information0
Issue Information0
Issue Information0
0
0
Issue Information0
0
Characterising ovoidal cones by their hyperplane intersection numbers0
Large families of permutations of Zn whose pairwise sums are permutations0
On the existence of k $k$‐cycle semiframes for even k $k$0
On strongly regular designs admitting fusion to strongly regular decomposition0
Issue Information0
Issue Information0
The existence of 23 ${2}^{3}$‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBDs0
Alternating parity weak sequencing0
0
The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$0
0
Symmetric 2‐(36,15,6) $(36,15,6)$ designs with an automorphism of order two0
0
0
The Terwilliger algebras of the group association schemes of three metacyclic groups0
Totally symmetric quasigroups of order 160
Issue Information0
Issue Information0
Stability of Erdős–Ko–Rado theorems in circle geometries0
Latin squares with five disjoint subsquares0
0
0
Completing the solution of the directed Oberwolfach problem with cycles of equal length0
New constructions for disjoint partial difference families and external partial difference families0
On eigenfunctions of the block graphs of geometric Steiner systems0
0
Issue Information0
Issue Information0
Issue Information0
0
0
Issue Information0
Alternating groups and point‐primitive linear spaces with number of points being squarefree0
Issue Information0
proper partial geometries with an automorphism group acting primitively on points and lines0
Linear and circular single‐change covering designs revisited0
Issue Information0
Issue Information0
0
Existence of small ordered orthogonal arrays0
0
0
0
Issue Information0
Construction of rank 4 self‐dual association schemes inducing three partial geometric designs0
0
Issue Information0
Issue Information0
Issue Information0
The combinatorial game Nofil played on Steiner triple systems0
The chromatic index of finite projective spaces0
Issue Information0
0
0
0
0
Colouring problems for symmetric configurations with block size 30
Constructing MRD codes by switching0
Issue Information0
On large partial ovoids of symplectic and Hermitian polar spaces0
0
Perfect and nearly perfect separation dimension of complete and random graphs0
0
On the equivalence of certain quasi‐Hermitian varieties0
Euclidean designs obtained from spherical embedding of coherent configurations0
Intercalates in double and triple arrays0
Constructing block designs with a prescribed automorphism group using genetic algorithm0
Issue Information0
Group divisible designs with block size 4 and group sizes 4 and 70
0.048153877258301