Journal of Combinatorial Designs

Papers
(The TQCC of Journal of Combinatorial Designs is 1. 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
On flag‐transitive imprimitive 2‐designs7
Evasive subspaces7
Perfect 2‐colorings of Hamming graphs7
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
Graph decompositions in projective geometries6
On an Assmus–Mattson type theorem for type I and even formally self‐dual codes5
Further results on large sets of partitioned incomplete Latin squares5
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
Plateaued functions on finite abelian groups and partial geometric difference sets4
Reconfiguration of subspace partitions3
Sparse Steiner triple systems of order 213
Edge balanced star‐hypergraph designs and vertex colorings of path designs3
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
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
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
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
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
0.041963815689087