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 2021-02-01 to 2025-02-01.)
ArticleCitations
Embedding in MDS codes and Latin cubes7
7
A generalization of group divisible t $t$‐designs7
6
6
Block‐transitive triple systems with sporadic or alternating socle5
Existence of small ordered orthogonal arrays5
Further results on large sets of partitioned incomplete Latin squares4
Quasimagic rectangles4
Primitive cycle decompositions of Kn and Kn−I4
Issue Information3
Issue Information3
Partial geometric designs having circulant concurrence matrices3
Enumeration of Latin squares with conjugate symmetry3
Issue Information3
Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces3
Partial orthomorphisms and Latin squares based on parts of a group3
3
proper partial geometries with an automorphism group acting primitively on points and lines2
The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$2
2
Sailing league problems2
Infinite series of 3‐designs in the extended quadratic residue code2
Tight globally simple nonzero sum Heffter arrays and biembeddings2
Issue Information2
Issue Information2
On symmetric designs with flag‐transitive and point‐quasiprimitive automorphism groups2
Issue Information2
Genuinely nonabelian partial difference sets2
The existence of irrational most perfect magic squares2
Ordered covering arrays and upper bounds on covering codes2
2
2
Issue Information2
Completing the solution of the directed Oberwolfach problem with cycles of equal length2
Magic partially filled arrays on abelian groups1
Issue Information1
Moufang sets generated by translations in unitals1
An explicit construction for large sets of infinite dimensional q $q$‐Steiner systems1
1
Algorithms and complexity for counting configurations in Steiner triple systems1
Construction of rank 4 self‐dual association schemes inducing three partial geometric designs1
Reduction for flag‐transitive point‐primitive 2‐(v, k, λ) designs with λ prime1
Issue Information1
Incidence‐free sets and edge domination in incidence graphs1
1
Intercalates in double and triple arrays1
Exceptional designs in some extended quadratic residue codes1
Issue Information1
Geometric dual and sum‐rank minimal codes1
Issue Information1
Extended near Skolem sequences, Part III1
On the chromatic number of some generalized Kneser graphs1
Issue Information1
Issue Information1
On optimal (Z6m×Z6n,4,1) and (Z2m×Z18n,4,1) difference packings and their related codes1
1
1
Block‐avoiding point sequencings1
Issue Information1
1
Extended near Skolem sequences Part I1
Characterising ovoidal cones by their hyperplane intersection numbers1
On products of strong Skolem starters1
0.067969083786011