Discrete Mathematics

Article	Citations
Formal self-duality and numerical self-duality for symmetric association schemes	47
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	35
Modulus for bases of matroids	31
Difference sets in pseudocyclic association schemes	28
Editorial Board	26
Editorial Board	25
Combinatorial properties of multidimensional continued fractions	24
Disjoint properly colored cycles in edge-colored complete bipartite graphs	24
A note on fully commutative elements in complex reflection groups	24
Enumerations of universal cycles for k-permutations	20
Tiling of rectangles with squares and related problems via Diophantine approximation	17
Bounding the Mostar index	17
Remarks on pseudo-vertex-transitive graphs with small diameter	16
Editorial Board	16
Vertex degree sums for matchings in 3-uniform hypergraphs	16
Turán number of complete bipartite graphs with bounded matching number	16
A primitivity condition for flag-transitive automorphism groups of 2-designs	15
Stack-sorting with stacks avoiding vincular patterns	15
Enumeration of permutations by the parity of descent positions	15
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	15
Weak degeneracy of line graphs of planar graphs	15
The k-apex trees with minimum augmented Zagreb index	14
The nucleus of the Johnson graph J(N,D)	14
The burning game on graphs	14
Spectral radius and hamiltonicity in split graphs	14

The weak version of the graph complement conjecture and partial results for the delta conjecture	13
Horofunctions of infinite Sierpiński polygon graphs	13
Diagonal poset Ramsey numbers	13
On 2-distance-balancedness of vertex transitive generalized Petersen graphs	13
A note on the restricted partition function p12
On well-dominated direct, Cartesian and strong product graphs	12
Lower bounds for book Ramsey numbers	12
On tetravalent 3-geodesic transitive graphs	12
Indivisibility for classes of graphs	12
Constructions of AEAQEC codes via matrix-product codes	11
Vertex-bipancyclicity in a bipartite graph collection	11
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	11
Holey Schröder designs of type 3u1	11
Constructing flag-transitive, point-primitive 2-designs from complete graphs	11
On the strict Chvátal-condition and nowhere-zero 3-flows	11
Minor exclusion in quasi-transitive graphs	11
Disjunctive domination in graphs with minimum degree at least two	11
A q-analogue of the bipartite distance matrix of a nonsingular tree	10
On Toeplitz codes of index t and isometry codes	10
Flow number and circular flow number of signed cubic graphs	10
Spanning trees with few branch vertices in K1,4-free graphs	10
On 13-crossing-critical graphs with arbitrarily large degrees	10
The signless Laplacian spectral radius of book-free graphs	10
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	10
On 2-factors with long cycles in 3-connected claw-free graphs	10
Generalized Turán results for intersecting cliques	10
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	10
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	10
Extreme and statistical properties of eigenvalue indices of simple connected graphs	10
Counting orientations of graphs with no strongly connected tournaments	9
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	9
On the existence and non-existence of spherical m-stiff configurations	9
Kempe equivalence of 4-colorings of graphs on non-orientable surfaces	9
On two conjectures about the intersection of longest paths and cycles	9
The most general structure of graphs with hamiltonian or hamiltonian connected square	9
Refinements of degree conditions for the existence of a spanning tree without small degree stems	9
Complete bipartite immersion in graphs with independence number two: A simple proof	9
Perfect state transfer on bi-Cayley graphs over abelian groups	9
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	9
The number of P-vertices for acyclic matrices with given nullity	9
About S-packing coloring of subcubic graphs	9
Diameter two orientability of mixed graphs	9
A p-centered coloring for the grid using O(p) colors	9
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	9
Planar graphs without normally adjacent short cycles	9
Proportion of blocking curves in a pencil	9
Progress towards the two-thirds conjecture on locating-total dominating sets	9
Editorial Board	8
Adjacent vertex distinguishing total coloring in split graphs	8
Cubic graphs have paired-domination number at most four-seventh of their orders	8

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	8
Algebraic and geometric multiplicities for some hypergraphs	8
On the maximum number of maximum dissociation sets in trees with given dissociation number	8
χ-Diperfect digraphs	8
A generalization of the Graham-Pollak tree theorem to Steiner distance	8
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	8
Generalized Turán results for edge blow-up of star forests	8
One-generator quasi-cyclic codes and their dual codes	8
Generalized graph splines and the Universal Difference Property	8
On MDS geometric Fq	8
An improved upper bound on the covering radius of the logarithmic lattice of	8
Indicated domination game	8
On the generalized Aα-spectral characterizations of almost α-controllable graphs	8
The invertible elements of the monoid of dead-ending misère games	8
Pull-push method: A new approach to edge-isoperimetric problems	8
A characterization of normal 3-pseudomanifolds with at most two singularities	8
On k-anti-traceability of oriented graphs	8
Spectral extremal graphs for edge blow-up of star forests	8
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	8
Optimal functions with spectral constraints in hypercubes	7
Editorial Board	7
Improved bounds on the chromatic number of (P5, flag)-free graphs	7
On mixed radial Moore graphs of diameter 3	7
Injective coloring of graphs revisited	7
Partitions and well-coveredness: The graph sandwich problem	7
Ternary near-extremal self-dual codes of lengths 36, 48 and 60	7
A class of negacyclic BCH codes and its dual	7
Quantum MDS codes with new length and large minimum distance	7
On the zero-sum subsequences of modular restricted lengths	7
Excluded checkerboard colourable ribbon graph minors	7
Graph realizations: Maximum degree in vertex neighborhoods	7
A characterisation of Fq	7
Covering the edges of a graph with triangles	7
On the minimal area of quadrangles circumscribed about planar convex bodies	7
Constructions of self-orthogonal and LCD subspace codes	7
Spanning 3-strong tournaments in 5-strong semicomplete digraphs	7
The effects of semantic simplifications on random BST-like expression-trees	7
A generalization of Alon–Aydinian–Huang theorem	7
On a conjecture about (m1,m2)-near-Skolem sequences	7
Every subcubic graph is packing (1,1,2,2,3)-colorable	7
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	7
Transversal coalitions in hypergraphs	7
Distributions of mesh patterns of short lengths on king permutations	7
On the saturation spectrum of the unions of disjoint cycles	6
Dot products in Fq	6
Ramsey numbers of trees versus generalized wheels	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
New probabilistic upper bounds on the domination number of a graph: II	6
Divisibility among power matrices associated with classes of arithmetic functions	6
Extremal graphs for star forests with bounded clique number	6
Maximal sets of Hamilton cycles in complete multipartite graphs IV	6
The optimal χ-bound for (P7,C4,C5)-free graphs	6
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	6
Secure domination in P5-free graphs	6
Further results on pinnacle sets	6
Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials	6
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	6
The odd girth of generalized Johnson graphs	6
Ordering Q-indices of graphs: Given size and circumference	6
The e-positivity of the chromatic symmetric function for twinned paths and cycles	6
Bijections in weakly increasing trees via binary trees	6
On graphs with exactly one anti-adjacency eigenvalue and beyond	6
Almost controllable graphs and beyond	6
On d-panconnected tournaments with large semidegrees	6
Solvable conjugacy class graph of groups	6
Improved results on linkage problems	6
On partitions of two-dimensional discrete boxes	6
Intersecting families with covering number five	6
New constructions of entanglement-assisted quantum MDS codes derived from generalized Reed-Solomon codes	6
Trees with one as Laplacian eigenvalue with multiplicity two less than the number of pendant vertices	6
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs	6
Critical Problem for a q-analogue of polymatroids	6
A safeness condition for minimal separators based on vertex connectivity	6
On finite groups whose power graph is claw-free	6
Query complexity of Boolean functions on slices	6
On singleton-type bound of locally repairable codes	6
Singular graphs and the reciprocal eigenvalue property	6
Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests	6
Limit points for the spectral radii of unbalanced signed graphs	6
Three edge-disjoint plane spanning paths in a point set	6

A characterization of optimal locally repairable codes	6
Identifying codes in graphs of given maximum degree: Characterizing trees	5
Editorial Board	5
Competitively orientable complete multipartite graphs	5
Waring numbers over finite commutative local rings	5
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	5
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	5
Irreducibility and spectra of eccentricity matrix of graph products	5
Mixed graphs with smallest eigenvalue greater than −	5
Antimagic labeling for unions of graphs with many three-paths	5
Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics	5
Intersecting longest paths in chordal graphs	5
Weak degeneracy of regular graphs	5
Illumination number of 3-dimensional cap bodies	5
The minimum size and maximum diameter of an edge-pancyclic graph of a given order	5
Minimal linear codes from defining sets over	5
The Kneser chromatic function distinguishes trees	5
A complete classification of edge-primitive graphs of valency 6	5
Spectrum of 3-uniform 6- and 9-cycle systems over Kv	5
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	5
Forbidden subdigraphs conditions on the Traceability Conjecture	5
Some bounds on the cardinality of the b-symbol weight spectrum of codes	5
Improved lower bound on the on-line chain partitioning of semi-orders with representation	5
On Ward numbers and increasing Schröder trees	5
On a ratio of Wiener indices for embedded graphs	5
Explicit exponential lower bounds for exact hyperplane covers	5
Large cliques in graphs with high chromatic number	5
D -index and	5
A general construction of strictly Neumaier graphs and a related switching	5
The dichromatic number of digraphs without induced subdigraphs	5
Partition identities related to the minimal excludant	5
Three classes of BCH codes and their duals	5
Counting degree-constrained orientations	5
Distinguishing symmetric digraphs by proper arc-colourings of type I	5
A cop-winning strategy on strongly cop-win graphs	5
Extremal spectral results related to spanning trees of signed complete graphs	5
State transfer on integral mixed circulant graphs	5
A note on the list vertex-arboricity of IC-planar graphs	5
Yet another proof of Brooks' theorem	5
Degree conditions for disjoint path covers in digraphs	5
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	5
Spectral extrema of 1-planar graphs	5
The trace reconstruction problem for spider graphs	5
Paintability of r-chromatic graphs	5
Covering almost all the layers of the hypercube with multiplicities	5
Bisections of directed graphs without complete bipartite subgraphs	5
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees	5
Packing a triangle by equilateral triangles of harmonic sidelengths	4
Monochromatic quotients, products and polynomial sums in the rationals	4
Schematic 4-designs	4
Difference graphs of étale algebras over finite fields	4
The idempotent of a class of p-ary BCH codes	4
An open problem of k-Galois hulls and its application	4
On graphs with unique geoodesics and antipodes	4
Group action approaches in Erdős quotient set problem	4
Generalized spectral characterizations of almost controllable graphs: Revisited	4
On off-diagonal ordered Ramsey numbers of nested matchings	4
The characterization of the lower bound on the dissociation number of trees	4
An (F	4
Wickets in 3-uniform hypergraphs	4
Editorial Board	4
The extended code for a class of generalized Roth-Lempel codes and their properties	4
Rotation r-graphs	4
A diameter bound for 4-edge-connected C4-free graphs	4
The 3-symmetric pseudolinear crossing number of K36	4
A Hall-type theorem with algorithmic consequences in planar graphs	4
Generalized quadrangles of order (s,s2). IV Translations, Moufang and Fong-Seitz	4
Turán numbers of general star forests in hypergraphs	4
Light 3-stars in embedded graphs	4
Induced saturation for complete bipartite posets	4
The density and minimal gap of visible points in some planar quasicrystals	4
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime	4
Ramsey goodness of fans	4
Subcubic planar graphs of girth 7 are class I	4
The maximum A-spectral radius of t-connected graphs with bounded matching number	4
On the enumeration and classification of σ-LCD codes over finite commutative chain rings	4
Graph reconstruction from connected triples	4
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas	4
Spectral Turán problems on the expansion of matchings	4
Non-jumping Turán densities of hypergraphs	4
Multistage positional games	4
Extensions of hitomezashi patterns	4
On a colored Turán problem of Diwan and Mubayi	4
Interval colourable orientations of graphs	4
Anti-Ramsey number of disjoint union of star-like hypergraphs	4
List star edge coloring of generalized Halin graphs	4
Oriented posets, rank matrices and q-deformed Markov numbers	4
Another tight description of faces in plane triangulations with minimum degree 4	4
Spectral extremal problem on the square of ℓ-cycle	4
Tournaments with maximal decomposability	4
q-ary (1,k)-overlap-free codes with given restrictions	4
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs	4
The maximum number of 10- and 12-cycles in a planar graph	4
On the number of small Steiner triple systems with Veblen points	4
Proper rainbow saturation numbers for cycles	4