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 2022-08-01 to 2026-08-01.)
ArticleCitations
The existence of irrational most perfect magic squares13
12
8
6
Issue Information5
Issue Information4
Issue Information4
An explicit construction for large sets of infinite dimensional q $q$‐Steiner systems4
Doubly Orthogonal Equi‐Squares and Sliced Orthogonal Arrays4
Recursive and Cyclic Constructions for Double‐Change Covering Designs3
Issue Information3
Quantum Latin Squares With all Possible Cardinalities3
1‐Rotational Balanced Incomplete Block Designs With Block Size Four and Arbitrary Index3
A generalization of group divisible t $t$‐designs3
Enumeration of E(s2)‐Optimal and Minimax‐Optimal Supersaturated Designs With 12 Rows, 11q Columns and smax=43
Colourings of Uniform Group Divisible Designs and Maximum Packings3
Characterising ovoidal cones by their hyperplane intersection numbers3
3
3
Issue Information2
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences2
Multidimensional Quadrangle Condition and Cuboctahedra in Latin Hypercubes2
3‐Designs From PSL(2,q) With Cyclic Starter Blocks2
Symmetric 2‐(35,17,8) Designs With an Automorphism of Order 22
2
The Maximal Cardinality of Quantum Latin Squares and Quantum Latin Cubes2
2
2
On 3‐Designs From PGL(2,q)2
2
Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$2
Untouchable Sets of Size 2q±1 in PG(2,q)2
Issue Information2
Steiner Triple Systems With High Discrepancy2
Stability of Erdős–Ko–Rado theorems in circle geometries2
1
Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs1
Issue Information1
1
Group divisible designs with block size 4 and group sizes 4 and 71
Issue Information1
Exceptional designs in some extended quadratic residue codes1
Toward a Baranyai Theorem With an Additional Condition1
New constructions for disjoint partial difference families and external partial difference families1
An Improvement on Triple Systems Without Two Types of Configurations1
The Existence of 32‐DSS (4,6)‐GDDs of Type gu1
1
Sporadic simple groups as flag‐transitive automorphism groups of symmetric designs1
On equitably 2‐colourable odd cycle decompositions1
Issue Information1
Partitioning the projective plane into two incidence‐rich parts1
Issue Information1
Completing Partial k‐Star Designs1
Alternating parity weak sequencing1
The chromatic index of finite projective spaces1
There Exist Steiner Systems S(2,8,225) and S(2,9,289)1
Latin squares with five disjoint subsquares1
1
On eigenfunctions of the block graphs of geometric Steiner systems1
Extensions of Steiner Triple Systems1
Issue Information1
Block‐Transitive Automorphism Groups of 2‐(v,5,λ) Designs1
1
The Oberwolfach problem with loving couples1
1
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique1
On the chromatic number of some generalized Kneser graphs0
0
0
Code Construction of Some Quasi‐Unbiased Weighing Matrices0
Issue Information0
0
Issue Information0
Incidence‐free sets and edge domination in incidence graphs0
Generalised evasive subspaces0
Issue Information0
Issue Information0
A Construction for Regular‐Graph Designs0
Issue Information0
How to Burn a Latin Square0
Totally symmetric quasigroups of order 160
On large partial ovoids of symplectic and Hermitian polar spaces0
Generalizations of some Nordhaus–Gaddum‐type results on spectral radius0
Existence of Magic Rectangle Sets Over Finite Abelian Groups0
Cameron–Liebler sets for maximal totally isotropic flats in classical affine spaces0
On symmetric designs with flag‐transitive and point‐quasiprimitive automorphism groups0
Every latin hypercube of order 5 has transversals0
Issue Information0
0
Issue Information0
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry0
Issue Information0
GDD Type Spanning Bipartite Block Designs0
0
Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T(q3,q) in PG(7,q3)0
Issue Information0
Existence of small ordered orthogonal arrays0
Issue Information0
0
The Terwilliger algebras of the group association schemes of three metacyclic groups0
Classification of Minimal Blocking Sets in PG(2,11) With a Nontrivial Automorphism Group0
Binary Codes From Subset Inclusion Matrices0
Construction of an Optimal (k,n) Multi‐Receiver Authentication Code Based on Orthogonal Arrays0
Issue Information0
Genuinely nonabelian partial difference sets0
Issue Information0
Mutual incidence matrix of two balanced incomplete block designs0
Zarankiewicz numbers near the triple system threshold0
proper partial geometries with an automorphism group acting primitively on points and lines0
On the existence of k $k$‐cycle semiframes for even k $k$0
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym(7)0
0
Linear and circular single‐change covering designs revisited0
Euclidean designs obtained from spherical embedding of coherent configurations0
Issue Information0
Toward a Solution of Archdeacon's Conjecture on Integer Heffter Arrays0
Issue Information0
0
0
0
Issue Information0
Issue Information0
Weak sequenceability in cyclic groups0
Issue Information0
Completing the spectrum of semiframes with block size three0
Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods0
Bent Functions on Finite Nonabelian Groups and Relative Difference Sets0
Avoiding Secants of Given Size in Finite Projective Planes0
Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG(3,q) $(3,q)$0
Issue Information0
Issue Information0
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
Issue Information0
Completely reducible super‐simple (v,4,4) $(v,4,4)$‐BIBDs and related constant weight codes0
0
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant0
Multifold 1‐perfect codes0
Geometric dual and sum‐rank minimal codes0
Lower Bounds and Construction of Detecting Arrays0
Enumeration and Construction of Row‐Column Designs0
Tic‐Tac‐Toe on Designs0
Issue Information0
An alternative construction of the Hermitian unital 2‐(28, 4, 1) design0
More Heffter Spaces via Finite Fields0
Variations on Bollobás Systems of d‐Partitions0
The existence of 23 ${2}^{3}$‐decomposable super‐simple (v,4,6) $(v,4,6)$‐BIBDs0
Simple 3‐Designs of PSL(2,2n) With Block Size 130
0
0
Completing the solution of the directed Oberwolfach problem with cycles of equal length0
Nonexistence of a 2‐(196,6,1) Design With a Point‐Transitive Automorphism Group0
Cycles of quadratic Latin squares and antiperfect 1‐factorisations0
Algebraic Capsets0
0
0
Issue Information0
Issue Information0
0
On Regular Quaternary Hadamard Matrices0
Combining the Theorems of Turán and de Bruijn–Erdős0
Issue Information0
0
Constructions of Optimal Sparse r‐Disjunct Matrices via Packings0
Tight globally simple nonzero sum Heffter arrays and biembeddings0
On MSRD Codes, h‐Designs and Disjoint Maximum Scattered Linear Sets0
Issue Information0
Enumerating Steiner triple systems0
Generalized Signed Langford Sequences0
Issue Information0
0
0
Construction of rank 4 self‐dual association schemes inducing three partial geometric designs0
Pairs in Nested Steiner Quadruple Systems0
On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure0
0
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays0
Self‐dual association schemes, fusions of Hamming schemes, and partial geometric designs0
Projective planes of order 12 do not have a collineation group of order 40
0
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction0
Orthogonal cycle systems with cycle length less than 100
Strong External Difference Families and Classification of α‐Valuations0
0
Towards the Ryser–Woodall λ $\lambda $‐design conjecture0
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles0
Issue Information0
Issue Information0
Tightness of the Weight‐Distribution Bound for Strongly Regular Polar Graphs0
0
Issue Information0
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph0
0
Magic partially filled arrays on abelian groups0
0
A Classification of the Flag‐Transitive 2‐(v,3,λ) Designs With v≡1,3(mod6) and v≡6(modλ)0
Maximum Shattering0
Issue Information0
Cycle Switching in Steiner Triple Systems of Order 190
On the Dimension of the Space Generated by Characteristic Vectors of MRD Codes0
Dual incidences and t‐designs in vector spaces0
0
Commuting Pairs in Quasigroups0
Issue Information0
0
New results on large sets of orthogonal arrays and orthogonal arrays0
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
On an Assmus–Mattson type theorem for type I and even formally self‐dual codes0
Doubly sequenceable groups0
Issue Information0
Ordered covering arrays and upper bounds on covering codes0
0
0
On the equivalence of certain quasi‐Hermitian varieties0
Issue Information0
Symmetric 2‐(36,15,6) $(36,15,6)$ designs with an automorphism of order two0
Nestings of BIBDs with block size four0
Issue Information0
Alternating groups and point‐primitive linear spaces with number of points being squarefree0
0
0
Sailing league problems0
Infinite series of 3‐designs in the extended quadratic residue code0
0
Block‐transitive triple systems with sporadic or alternating socle0
Completely (Quasi‐)Uniform Nested Boolean Steiner Quadruple Systems0
Subsquares in Random Latin Squares and Rectangles0
Issue Information0
0
0
Issue Information0
Issue Information0
A Note on Finding Large Transversals Efficiently0
On products of strong Skolem starters0
Reduction for flag‐transitive point‐primitive 2‐(v, k, λ) designs with λ prime0
P℘N functions, complete mappings and quasigroup difference sets0
Partition of ordered triples into uniform holey ordered designs0
Constructing MRD codes by switching0
0.1411190032959