Discrete Mathematics

Article	Citations
Formal self-duality and numerical self-duality for symmetric association schemes	36
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	30
Constructing flag-transitive, point-primitive 2-designs from complete graphs	28
Remarks on pseudo-vertex-transitive graphs with small diameter	26
Spectral radius and hamiltonicity in split graphs	26
Vertex degree sums for matchings in 3-uniform hypergraphs	25
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	23
Generalized Turán results for intersecting cliques	22
Modulus for bases of matroids	21
Difference sets in pseudocyclic association schemes	20
Editorial Board	20
Editorial Board	18
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	18
Enumeration of permutations by the parity of descent positions	16
A note on the restricted partition function p15
A characterization of graphs with given maximum degree and smallest possible matching number: II	15
Reconstructibility of a general DNA evolution model	15
A note on fully commutative elements in complex reflection groups	14
Combinatorial properties of multidimensional continued fractions	14
Disjunctive domination in graphs with minimum degree at least two	14
Disjoint properly colored cycles in edge-colored complete bipartite graphs	14
A note on multicolor Ramsey number of small odd cycles versus a large clique	14
Bounding the Mostar index	13
Holey Schröder designs of type 3u1	13
Minor exclusion in quasi-transitive graphs	13

Flow number and circular flow number of signed cubic graphs	13
Tiling of rectangles with squares and related problems via Diophantine approximation	13
Enumerations of universal cycles for k-permutations	13
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	13
On Toeplitz codes of index t and isometry codes	12
Turán number of complete bipartite graphs with bounded matching number	12
Weak degeneracy of line graphs of planar graphs	12
The k-apex trees with minimum augmented Zagreb index	12
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	12
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	12
Vertex-bipancyclicity in a bipartite graph collection	12
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	11
On well-dominated direct, Cartesian and strong product graphs	11
Constructions of AEAQEC codes via matrix-product codes	10
On 13-crossing-critical graphs with arbitrarily large degrees	10
Spanning trees with few branch vertices in K1,4-free graphs	10
Equitable partitions into matchings and coverings in mixed graphs	10
On 2-factors with long cycles in 3-connected claw-free graphs	10
The signless Laplacian spectral radius of book-free graphs	10
Extreme and statistical properties of eigenvalue indices of simple connected graphs	10
Generalized Turán results for edge blow-up of star forests	10
A q-analogue of the bipartite distance matrix of a nonsingular tree	9
Spectral strengthening of a theorem on transversal critical graphs	9
Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme	9
χ-Diperfect digraphs	9
Counting orientations of graphs with no strongly connected tournaments	9
Modular Fuss-Catalan numbers	9
A p-centered coloring for the grid using O(p) colors	9
The most general structure of graphs with hamiltonian or hamiltonian connected square	9
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	9
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	9
On MDS geometric Fq	8
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	8
Complete bipartite immersion in graphs with independence number two: A simple proof	8
On two conjectures about the intersection of longest paths and cycles	8
Pull-push method: A new approach to edge-isoperimetric problems	8
Indicated domination game	8
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	8
On k-anti-traceability of oriented graphs	8
Generalized graph splines and the Universal Difference Property	8
Proportion of blocking curves in a pencil	8
One-generator quasi-cyclic codes and their dual codes	8
Progress towards the two-thirds conjecture on locating-total dominating sets	8
About S-packing coloring of subcubic graphs	8
Planar graphs without normally adjacent short cycles	8
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	8
Perfect state transfer on bi-Cayley graphs over abelian groups	8
Improved bounds on the chromatic number of (P5, flag)-free graphs	7
On the existence and non-existence of spherical m-stiff configurations	7
Serial exchanges in matroids	7

On the maximum number of maximum dissociation sets in trees with given dissociation number	7
Local metric dimension for graphs with small clique numbers	7
Editorial Board	7
A generalization of the Graham-Pollak tree theorem to Steiner distance	7
Editorial Board	7
Maximal sets of Hamilton cycles in complete multipartite graphs IV	7
Diameter two orientability of mixed graphs	7
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	7
The invertible elements of the monoid of dead-ending misère games	7
The number of P-vertices for acyclic matrices with given nullity	7
Algebraic and geometric multiplicities for some hypergraphs	7
Nullity and singularity of a graph in which every block is a cycle	7
Refinements of degree conditions for the existence of a spanning tree without small degree stems	7
Cubic graphs have paired-domination number at most four-seventh of their orders	7
A characterization of normal 3-pseudomanifolds with at most two singularities	7
Adjacent vertex distinguishing total coloring in split graphs	7
Isolation of k-cliques II	7
The odd girth of generalized Johnson graphs	7
Mixed cages: Monotonicity, connectivity and upper bounds	7
The inverse eigenvalue problem for linear trees	7
On the generalized A-spectral characterizations of almost α-controllable graphs	7
Graph realizations: Maximum degree in vertex neighborhoods	7
Further results on pinnacle sets	7
Spectral extremal graphs for edge blow-up of star forests	7
Critical Problem for a q-analogue of polymatroids	6
On a conjecture about (m1,m2)-near-Skolem sequences	6
Covering the edges of a graph with triangles	6
Every subcubic graph is packing (1,1,2,2,3)-colorable	6
Constructions of Z-optimal Type-II quadriphase Z-complementary pairs	6
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	6
Singular graphs and the reciprocal eigenvalue property	6
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	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
On mixed radial Moore graphs of diameter 3	6
Solvable conjugacy class graph of groups	6
Ordering Q-indices of graphs: Given size and circumference	6
The optimal χ-bound for (P7,C4,C5)-free graphs	6
A safeness condition for minimal separators based on vertex connectivity	6
Dot products in Fq	6
Bijections in weakly increasing trees via binary trees	6
On the saturation spectrum of the unions of disjoint cycles	6
Pinnacle set properties	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
Excluded checkerboard colourable ribbon graph minors	6
A generalization of Alon–Aydinian–Huang theorem	6
Injective coloring of graphs revisited	6
The effects of semantic simplifications on random BST-like expression-trees	6
Generalized rainbow Turán numbers of odd cycles	6
Query complexity of Boolean functions on slices	6
Almost controllable graphs and beyond	6
On finite groups whose power graph is claw-free	6
Transversal coalitions in hypergraphs	6
Partitions and well-coveredness: The graph sandwich problem	6
Optimal functions with spectral constraints in hypercubes	6
On d-panconnected tournaments with large semidegrees	6
A characterization of optimal locally repairable codes	6
The trace reconstruction problem for spider graphs	5
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	5
On Delannoy paths without peaks and valleys	5
Intersecting longest paths in chordal graphs	5
Improved lower bound on the on-line chain partitioning of semi-orders with representation	5
The e-positivity of the chromatic symmetric function for twinned paths and cycles	5
On vertex-induced weighted Turán problems	5
Covering almost all the layers of the hypercube with multiplicities	5
Degree conditions for disjoint path covers in digraphs	5
Induced saturation for complete bipartite posets	5
A class of negacyclic BCH codes and its dual	5
New probabilistic upper bounds on the domination number of a graph: II	5
On partitions of two-dimensional discrete boxes	5
Intersecting families with covering number five	5
On a ratio of Wiener indices for embedded graphs	5
A general construction of strictly Neumaier graphs and a related switching	5
Three classes of BCH codes and their duals	5
State transfer on integral mixed circulant graphs	5
Yet another proof of Brooks' theorem	5
Spectral extrema of 1-planar graphs	5
Divisibility among power matrices associated with classes of arithmetic functions	5
Paintability of r-chromatic graphs	5

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	5
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	5
Ternary near-extremal self-dual codes of lengths 36, 48 and 60	5
The inverse of circulant matrices over GF(2 )	5
Improved results on linkage problems	5
Forbidden subdigraphs conditions on the Traceability Conjecture	5
A cop-winning strategy on strongly cop-win graphs	5
Accumulation points of the edit distance function	5
Large cliques in graphs with high chromatic number	5
Waring numbers over finite commutative local rings	5
Mixed graphs with smallest eigenvalue greater than −	5
On singleton-type bound of locally repairable codes	5
Extremal graphs for star forests with bounded clique number	5
Weak degeneracy of regular graphs	5
On graphs with exactly one anti-adjacency eigenvalue and beyond	5
Distributions of mesh patterns of short lengths on king permutations	5
Quantum MDS codes with new length and large minimum distance	5
Weight distributions of two classes of linear codes with five or six weights	5
On the domination number of graphs with minimum degree at least seven	4
On off-diagonal ordered Ramsey numbers of nested matchings	4
The weight spectrum of two families of Reed-Muller codes	4
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs	4
On graphs with unique geoodesics and antipodes	4
Path-monochromatic bounded depth rooted trees in (random) tournaments	4
On the number of small Steiner triple systems with Veblen points	4
The density and minimal gap of visible points in some planar quasicrystals	4
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	4
Partition identities related to the minimal excludant	4
On a colored Turán problem of Diwan and Mubayi	4
Rotation r-graphs	4
An overview of graph covering and partitioning	4
Packing a triangle by equilateral triangles of harmonic sidelengths	4
Spectral extremal problem on the square of ℓ-cycle	4
Subfield codes of C-codes over F	4
Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics	4
Extremal bounds for pattern avoidance in multidimensional 0-1 matrices	4
The Turán number of Berge-matching in hypergraphs	4
An (F	4
D -index and	4
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs	4
Rainbow directed version of Dirac's theorem	4
The Haglund–Remmel–Wilson identity for set partitions	4
A rooted variant of Stanley's chromatic symmetric function	4
An open problem of k-Galois hulls and its application	4
q-ary (1,k)-overlap-free codes with given restrictions	4
On the enumeration and classification of σ-LCD codes over finite commutative chain rings	4
List star edge coloring of generalized Halin graphs	4
Editorial Board	4
The weight hierarchies of linear codes from simplicial complexes	4
Contractible edges and liftable vertices in a 4-connected graph	4
Every planar graph with girth at least 5 is (1,9)-colorable	4
Optimal coloring of (P2 + P3, gem)-free graphs	4
Explicit exponential lower bounds for exact hyperplane covers	4
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	4
Two Hamiltonian cycles	4
Modulo factors with bounded degrees	4
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	4
Interval colourable orientations of graphs	4
A note on the list vertex-arboricity of IC-planar graphs	4
Difference graphs of étale algebras over finite fields	4
Extremal spectral results related to spanning trees of signed complete graphs	4
Eulerian pairs and Eulerian recurrence systems	4
A complete classification of edge-primitive graphs of valency 6	4
Poset positional games	4
Minimal linear codes from defining sets over	4
Editorial Board	4
Tournaments with maximal decomposability	4
The maximum A-spectral radius of t-connected graphs with bounded matching number	4
The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights	4
Tree evolution processes for bucket increasing trees	4
An extension of spectral Mantel's theorem on wheels	4
The uncertainty principle over finite fields	4
Another tight description of faces in plane triangulations with minimum degree 4	4
Recolouring weakly chordal graphs and the complement of triangle-free graphs	4
Editorial Board	4
Anti-Ramsey number of disjoint union of star-like hypergraphs	4
Editorial Board	4
Competitively orientable complete multipartite graphs	4
Localized version of hypergraph Erdős-Gallai Theorem	4
Index of parameters of iterated line graphs	4
Subcubic planar graphs of girth 7 are class I	4
Packing of the k-power of Hamilton cycles	4
Bisections of directed graphs without complete bipartite subgraphs	4
Bender–Knuth involutions on linear extensions of posets	4
Some bounds on the cardinality of the b-symbol weight spectrum of codes	4
Signed planar graphs with given circular chromatic numbers	4
The minimum size and maximum diameter of an edge-pancyclic graph of a given order	4
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas	4
Antimagic labeling for unions of graphs with many three-paths	4
On integral graphs which belong to the class α	4
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs	4
On the bijective colouring of Cantor trees based on transducers	4
The maximum number of 10- and 12-cycles in a planar graph	4
Editorial Board	4
Group action approaches in Erdős quotient set problem	4