Discrete Mathematics

Article	Citations
Formal self-duality and numerical self-duality for symmetric association schemes	44
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	36
Constructing flag-transitive, point-primitive 2-designs from complete graphs	32
Modulus for bases of matroids	30
Difference sets in pseudocyclic association schemes	29
Editorial Board	25
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	24
Editorial Board	23
Reconstructibility of a general DNA evolution model	22
Combinatorial properties of multidimensional continued fractions	20
A note on multicolor Ramsey number of small odd cycles versus a large clique	17
Disjoint properly colored cycles in edge-colored complete bipartite graphs	16
Minor exclusion in quasi-transitive graphs	16
Enumerations of universal cycles for k-permutations	16
A note on fully commutative elements in complex reflection groups	16
Flow number and circular flow number of signed cubic graphs	16
Bounding the Mostar index	15
Tiling of rectangles with squares and related problems via Diophantine approximation	15
Holey Schröder designs of type 3u1	14
Editorial Board	14
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	14
Turán number of complete bipartite graphs with bounded matching number	14
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	13
Vertex degree sums for matchings in 3-uniform hypergraphs	13
Weak degeneracy of line graphs of planar graphs	13

Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	13
Enumeration of permutations by the parity of descent positions	13
Remarks on pseudo-vertex-transitive graphs with small diameter	13
Stack-sorting with stacks avoiding vincular patterns	13
The k-apex trees with minimum augmented Zagreb index	12
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	12
Disjunctive domination in graphs with minimum degree at least two	12
The nucleus of the Johnson graph J(N,D)	12
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	11
The signless Laplacian spectral radius of book-free graphs	11
The burning game on graphs	11
Generalized Turán results for intersecting cliques	11
Spectral radius and hamiltonicity in split graphs	10
Lower bounds for book Ramsey numbers	10
The weak version of the graph complement conjecture and partial results for the delta conjecture	10
A note on the restricted partition function p10
Diagonal poset Ramsey numbers	10
Constructions of AEAQEC codes via matrix-product codes	10
On the strict Chvátal-condition and nowhere-zero 3-flows	10
On Toeplitz codes of index t and isometry codes	10
On tetravalent 3-geodesic transitive graphs	10
On well-dominated direct, Cartesian and strong product graphs	10
Vertex-bipancyclicity in a bipartite graph collection	10
Indivisibility for classes of graphs	10
χ-Diperfect digraphs	9
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	9
A q-analogue of the bipartite distance matrix of a nonsingular tree	9
Spanning trees with few branch vertices in K1,4-free graphs	9
On MDS geometric Fq	9
Spectral extremal graphs for edge blow-up of star forests	9
Extreme and statistical properties of eigenvalue indices of simple connected graphs	9
On 2-factors with long cycles in 3-connected claw-free graphs	9
A p-centered coloring for the grid using O(p) colors	9
Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme	9
On 13-crossing-critical graphs with arbitrarily large degrees	9
Refinements of degree conditions for the existence of a spanning tree without small degree stems	8
A generalization of the Graham-Pollak tree theorem to Steiner distance	8
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	8
Perfect state transfer on bi-Cayley graphs over abelian groups	8
Proportion of blocking curves in a pencil	8
Pull-push method: A new approach to edge-isoperimetric problems	8
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	8
Diameter two orientability of mixed graphs	8
One-generator quasi-cyclic codes and their dual codes	8
On the existence and non-existence of spherical m-stiff configurations	8
On the maximum number of maximum dissociation sets in trees with given dissociation number	8
Planar graphs without normally adjacent short cycles	8
Nullity and singularity of a graph in which every block is a cycle	8
Cubic graphs have paired-domination number at most four-seventh of their orders	8
On the generalized A-spectral characterizations of almost α-controllable graphs	8

Counting orientations of graphs with no strongly connected tournaments	8
Indicated domination game	8
Complete bipartite immersion in graphs with independence number two: A simple proof	8
On k-anti-traceability of oriented graphs	8
On two conjectures about the intersection of longest paths and cycles	8
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	8
An improved upper bound on the covering radius of the logarithmic lattice of	8
The number of P-vertices for acyclic matrices with given nullity	8
Solvable conjugacy class graph of groups	7
Excluded checkerboard colourable ribbon graph minors	7
Algebraic and geometric multiplicities for some hypergraphs	7
Generalized Turán results for edge blow-up of star forests	7
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	7
About S-packing coloring of subcubic graphs	7
Maximal sets of Hamilton cycles in complete multipartite graphs IV	7
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	7
Isolation of k-cliques II	7
The most general structure of graphs with hamiltonian or hamiltonian connected square	7
Generalized graph splines and the Universal Difference Property	7
The invertible elements of the monoid of dead-ending misère games	7
Further results on pinnacle sets	7
Editorial Board	7
A generalization of Alon–Aydinian–Huang theorem	7
Mixed cages: Monotonicity, connectivity and upper bounds	7
A characterization of normal 3-pseudomanifolds with at most two singularities	7
Progress towards the two-thirds conjecture on locating-total dominating sets	7
Editorial Board	7
Adjacent vertex distinguishing total coloring in split graphs	7
Improved bounds on the chromatic number of (P5, flag)-free graphs	7
A safeness condition for minimal separators based on vertex connectivity	6
On finite groups whose power graph is claw-free	6
Graph realizations: Maximum degree in vertex neighborhoods	6
On a conjecture about (m1,m2)-near-Skolem sequences	6
On d-panconnected tournaments with large semidegrees	6
The effects of semantic simplifications on random BST-like expression-trees	6
Pinnacle set properties	6
New probabilistic upper bounds on the domination number of a graph: II	6
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
Query complexity of Boolean functions on slices	6
Ordering Q-indices of graphs: Given size and circumference	6
Covering the edges of a graph with triangles	6
Partitions and well-coveredness: The graph sandwich problem	6
Optimal functions with spectral constraints in hypercubes	6
Transversal coalitions in hypergraphs	6
The optimal χ-bound for (P7,C4,C5)-free graphs	6
Intersecting families with covering number five	6
Divisibility among power matrices associated with classes of arithmetic functions	6
Almost controllable graphs and beyond	6
Bijections in weakly increasing trees via binary trees	6
Dot products in Fq	6
Spanning 3-strong tournaments in 5-strong semicomplete digraphs	6
On the zero-sum subsequences of modular restricted lengths	6
A characterisation of Fq	6
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	6
Improved results on linkage problems	6
Critical Problem for a q-analogue of polymatroids	6
Limit points for the spectral radii of unbalanced signed graphs	5
A characterization of optimal locally repairable codes	5
Weak degeneracy of regular graphs	5
The odd girth of generalized Johnson graphs	5
On mixed radial Moore graphs of diameter 3	5
Yet another proof of Brooks' theorem	5
Ramsey numbers of trees versus generalized wheels	5
Injective coloring of graphs revisited	5
State transfer on integral mixed circulant graphs	5
Distributions of mesh patterns of short lengths on king permutations	5
Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials	5
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	5
D -index and	5
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees	5
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	5
A cop-winning strategy on strongly cop-win graphs	5
Three edge-disjoint plane spanning paths in a point set	5
Trees with one as Laplacian eigenvalue with multiplicity two less than the number of pendant vertices	5
On Delannoy paths without peaks and valleys	5
New constructions of entanglement-assisted quantum MDS codes derived from generalized Reed-Solomon codes	5
Quantum MDS codes with new length and large minimum distance	5
Covering almost all the layers of the hypercube with multiplicities	5
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs	5

Ternary near-extremal self-dual codes of lengths 36, 48 and 60	5
Paintability of r-chromatic graphs	5
Every subcubic graph is packing (1,1,2,2,3)-colorable	5
On partitions of two-dimensional discrete boxes	5
The trace reconstruction problem for spider graphs	5
Singular graphs and the reciprocal eigenvalue property	5
Weight distributions of two classes of linear codes with five or six weights	5
Distinguishing symmetric digraphs by proper arc-colourings of type I	5
Partition identities related to the minimal excludant	5
Forbidden subdigraphs conditions on the Traceability Conjecture	5
Index of parameters of iterated line graphs	5
Waring numbers over finite commutative local rings	5
Extremal graphs for star forests with bounded clique number	5
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	5
On a ratio of Wiener indices for embedded graphs	5
On the saturation spectrum of the unions of disjoint cycles	5
Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests	5
Mixed graphs with smallest eigenvalue greater than −	5
Secure domination in P5-free graphs	5
On graphs with exactly one anti-adjacency eigenvalue and beyond	5
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	5
A class of negacyclic BCH codes and its dual	5
On singleton-type bound of locally repairable codes	5
Improved lower bound on the on-line chain partitioning of semi-orders with representation	5
Spectral extrema of 1-planar graphs	5
A general construction of strictly Neumaier graphs and a related switching	5
On Ward numbers and increasing Schröder trees	5
The minimum size and maximum diameter of an edge-pancyclic graph of a given order	5
Bisections of directed graphs without complete bipartite subgraphs	5
Spectrum of 3-uniform 6- and 9-cycle systems over Kv	5
The e-positivity of the chromatic symmetric function for twinned paths and cycles	5
Competitively orientable complete multipartite graphs	5
Intersecting longest paths in chordal graphs	4
Wickets in 3-uniform hypergraphs	4
Degree conditions for disjoint path covers in digraphs	4
Editorial Board	4
Three classes of BCH codes and their duals	4
On the bijective colouring of Cantor trees based on transducers	4
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	4
The maximum number of 10- and 12-cycles in a planar graph	4
Minimal linear codes from defining sets over	4
Editorial Board	4
Two Hamiltonian cycles	4
Extremal spectral results related to spanning trees of signed complete graphs	4
Anti-Ramsey number of disjoint union of star-like hypergraphs	4
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs	4
The density and minimal gap of visible points in some planar quasicrystals	4
The weight spectrum of two families of Reed-Muller codes	4
A sufficient condition for complete multipartite graphs to be of Type 1	4
Poset positional games	4
Spectral extremal problem on the square of ℓ-cycle	4
The idempotent of a class of p-ary BCH codes	4
An open problem of k-Galois hulls and its application	4
Antimagic labeling for unions of graphs with many three-paths	4
Spectral Turán problems on the expansion of matchings	4
The dichromatic number of digraphs without induced subdigraphs	4
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas	4
A note on the list vertex-arboricity of IC-planar graphs	4
Cyclic balanced sampling plans avoiding adjacent units with block size four	4
Some bounds on the cardinality of the b-symbol weight spectrum of codes	4
q-ary (1,k)-overlap-free codes with given restrictions	4
Tree evolution processes for bucket increasing trees	4
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	4
On a colored Turán problem of Diwan and Mubayi	4
Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics	4
Tournaments with maximal decomposability	4
Enumeration of perfect matchings of the middle graph of a graph G with △(G)≤4	4
An (F	4
Weak star-Drazin and Drazin-star matrices	4
On the domination number of graphs with minimum degree at least seven	4
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4	4
Oriented posets, rank matrices and q-deformed Markov numbers	4
On graphs with unique geoodesics and antipodes	4
A complete classification of edge-primitive graphs of valency 6	4
On monomial dihedral symmetric Boolean functions	4
Explicit exponential lower bounds for exact hyperplane covers	4
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs	4
Induced saturation for complete bipartite posets	4
On the number of small Steiner triple systems with Veblen points	4
Large cliques in graphs with high chromatic number	4
On the enumeration and classification of σ-LCD codes over finite commutative chain rings	4
Every planar graph with girth at least 5 is (1,9)-colorable	4
The maximum A-spectral radius of t-connected graphs with bounded matching number	4
Another tight description of faces in plane triangulations with minimum degree 4	4
Accumulation points of the edit distance function	4
Subcubic planar graphs of girth 7 are class I	4
An overview of graph covering and partitioning	4
List star edge coloring of generalized Halin graphs	4
The Haglund–Remmel–Wilson identity for set partitions	4
The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights	4
On off-diagonal ordered Ramsey numbers of nested matchings	4
The characterization of the lower bound on the dissociation number of trees	4
Generalized spectral characterizations of almost controllable graphs: Revisited	4
On integral graphs which belong to the class α	4
Ramsey goodness of fans	4