Discrete Mathematics

Article	Citations
Editorial Board	23
Editorial Board	22
Tiling of rectangles with squares and related problems via Diophantine approximation	21
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	21
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	21
The k-apex trees with minimum augmented Zagreb index	20
Difference sets in pseudocyclic association schemes	20
Disjunctive domination in graphs with minimum degree at least two	19
Enumeration of permutations by the parity of descent positions	19
Reconfiguration of homomorphisms to reflexive digraph cycles	17
A new sieve for restricted multiset counting	17
Rainbow polygons for colored point sets in the plane	16
On (1,2)-domination in cubic graphs	16
A characterization of graphs with given maximum degree and smallest possible matching number: II	16
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	15
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	14
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	14
Constructing flag-transitive, point-primitive 2-designs from complete graphs	14
A note on multicolor Ramsey number of small odd cycles versus a large clique	14
Disjoint properly colored cycles in edge-colored complete bipartite graphs	14
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	13
Minor exclusion in quasi-transitive graphs	13
Bounding the Mostar index	12
Combinatorial properties of multidimensional continued fractions	12
Holey Schröder designs of type 3u1	12

Vertex degree sums for matchings in 3-uniform hypergraphs	12
On Toeplitz codes of index t and isometry codes	11
Modulus for bases of matroids	11
Constructions of AEAQEC codes via matrix-product codes	11
Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊	11
Enumerations of universal cycles for k-permutations	11
Formal self-duality and numerical self-duality for symmetric association schemes	11
Extremal problems and results related to Gallai-colorings	11
Flow number and circular flow number of signed cubic graphs	10
Remarks on pseudo-vertex-transitive graphs with small diameter	10
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	10
On well-dominated direct, Cartesian and strong product graphs	10
Symmetric graphs of prime valency associated with some almost simple groups	10
A note on the restricted partition function p10
A note on fully commutative elements in complex reflection groups	10
Reconstructibility of a general DNA evolution model	10
Equitable partitions into matchings and coverings in mixed graphs	9
Generalized Turán results for intersecting cliques	9
Nullity and singularity of a graph in which every block is a cycle	9
A system of disjoint representatives of line segments with given k directions	9
Vertex-bipancyclicity in a bipartite graph collection	9
Bipartite biregular Moore graphs	9
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9	9
Note on sunflowers	9
A spectral property for concurrent systems and some probabilistic applications	9
The number of P-vertices for acyclic matrices with given nullity	9
Structure of edges in plane graphs with bounded dual edge weight	9
Modular Fuss-Catalan numbers	8
On MDS geometric Fq	8
Serial exchanges in matroids	8
Local metric dimension for graphs with small clique numbers	8
Mixed cages: Monotonicity, connectivity and upper bounds	8
Spectral strengthening of a theorem on transversal critical graphs	8
Perfect state transfer on bi-Cayley graphs over abelian groups	8
Refinements of degree conditions for the existence of a spanning tree without small degree stems	8
Counting orientations of graphs with no strongly connected tournaments	7
Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme	7
A p-centered coloring for the grid using O(p) colors	7
Indicated domination game	7
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	7
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	7
Cubic graphs have paired-domination number at most four-seventh of their orders	7
One-generator quasi-cyclic codes and their dual codes	7
On self-dual skew cyclic codes of length p over F<	7
Algebraic and geometric multiplicities for some hypergraphs	7
Progress towards the two-thirds conjecture on locating-total dominating sets	7
χ-Diperfect digraphs	7
On 13-crossing-critical graphs with arbitrarily large degrees	7
A q-analogue of the bipartite distance matrix of a nonsingular tree	7
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	7

The inverse eigenvalue problem for linear trees	7
Pull-push method: A new approach to edge-isoperimetric problems	7
Planar graphs without normally adjacent short cycles	7
On k-anti-traceability of oriented graphs	7
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	7
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	7
Generalized graph splines and the Universal Difference Property	6
Extreme and statistical properties of eigenvalue indices of simple connected graphs	6
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	6
Isolation of k-cliques II	6
A characterisation of Fq	6
Injective coloring of graphs revisited	6
The inverse of circulant matrices over GF(2 )	6
A generalization of the Graham-Pollak tree theorem to Steiner distance	6
On two conjectures about the intersection of longest paths and cycles	6
On the maximum number of maximum dissociation sets in trees with given dissociation number	6
About S-packing coloring of subcubic graphs	6
On 2-factors with long cycles in 3-connected claw-free graphs	6
The odd girth of generalized Johnson graphs	6
Editorial Board	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
Z-knotted and 6
A characterization of normal 3-pseudomanifolds with at most two singularities	6
Generalized Turán results for edge blow-up of star forests	6
Spanning trees with few branch vertices in K1,4-free graphs	6
The most general structure of graphs with hamiltonian or hamiltonian connected square	6
Query complexity of Boolean functions on slices	6
Further results on pinnacle sets	6
Graph realizations: Maximum degree in vertex neighborhoods	6
The effects of semantic simplifications on random BST-like expression-trees	6
On vertex-induced weighted Turán problems	6
Editorial Board	6
On the generalized A-spectral characterizations of almost α-controllable graphs	6
Spectral extremal graphs for edge blow-up of star forests	6
On finite groups whose power graph is claw-free	5
On the zero-sum subsequences of modular restricted lengths	5
Covering almost all the layers of the hypercube with multiplicities	5
The optimal χ-bound for (P7,C4,C5)-free graphs	5
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	5
Improved lower bound on the on-line chain partitioning of semi-orders with representation	5
Excluded checkerboard colourable ribbon graph minors	5
The invertible elements of the monoid of dead-ending misère games	5
Dot products inFq	5
Adjacent vertex distinguishing total coloring in split graphs	5
On partitions of two-dimensional discrete boxes	5
A generalization of Alon–Aydinian–Huang theorem	5
A characterization of optimal locally repairable codes	5
Maximal sets of Hamilton cycles in complete multipartite graphs IV	5
Transversal coalitions in hypergraphs	5
On a conjecture about (m1,m2)-near-Skolem sequences	5
Yet another proof of Brooks' theorem	5
On mixed radial Moore graphs of diameter 3	5
Ordering Q-indices of graphs: Given size and circumference	5
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	5
Almost controllable graphs and beyond	5
Exact hyperplane covers for subsets of the hypercube	5
Critical Problem for a q-analogue of polymatroids	5
Decompositions of a rectangle into non-congruent rectangles of equal area	5
Quantum MDS codes with new length and large minimum distance	5
Covering the edges of a graph with triangles	5
On d-panconnected tournaments with large semidegrees	5
Pinnacle set properties	5
Improved results on linkage problems	5
State transfer on integral mixed circulant graphs	5
Solvable conjugacy class graph of groups	5
Improved bounds on the chromatic number of (P5, flag)-free graphs	5
On graphs with exactly one anti-adjacency eigenvalue and beyond	5
Generalized rainbow Turán numbers of odd cycles	5
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	5
Divisibility among power matrices associated with classes of arithmetic functions	5
Constructions of Z-optimal Type-II quadriphase Z-complementary pairs	5
Singular graphs and the reciprocal eigenvalue property	5
On the saturation spectrum of the unions of disjoint cycles	5
Spanning 3-strong tournaments in 5-strong semicomplete digraphs	5
Optimal functions with spectral constraints in hypercubes	5
Partitions and well-coveredness: The graph sandwich problem	5
Card shuffling and P-partitions	4
On a ratio of Wiener indices for embedded graphs	4
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	4
Subcubic planar graphs of girth 7 are class I	4

Spectrum of 3-uniform 6- and 9-cycle systems over Kv	4
Three classes of BCH codes and their duals	4
Weak degeneracy of regular graphs	4
Extremal spectral results related to spanning trees of signed complete graphs	4
On Turán-good graphs	4
The trace reconstruction problem for spider graphs	4
Non-jumping Turán densities of hypergraphs	4
Recolouring weakly chordal graphs and the complement of triangle-free graphs	4
A general construction of strictly Neumaier graphs and a related switching	4
Editorial Board	4
Another tight description of faces in plane triangulations with minimum degree 4	4
Antimagic labeling for unions of graphs with many three-paths	4
Partition identities related to the minimal excludant	4
Wickets in 3-uniform hypergraphs	4
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	4
Corrigendum to “On the sum of the first two largest signless Laplacian eigenvalues of a graph” [Discrete Math. 347 (2024) 114035]	4
Forbidden subdigraphs conditions on the Traceability Conjecture	4
On a colored Turán problem of Diwan and Mubayi	4
Explicit exponential lower bounds for exact hyperplane covers	4
The maximum A-spectral radius of t-connected graphs with bounded matching number	4
Intersecting longest paths in chordal graphs	4
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	4
The Turán number of Berge-matching in hypergraphs	4
A complete classification of edge-primitive graphs of valency 6	4
D-index and 4
Mixed graphs with smallest eigenvalue greater than −	4
Regular graphs of girth 5 from elliptic semiplanes of type C	4
Accumulation points of the edit distance function	4
Editorial Board	4
Minor obstructions for apex-pseudoforests	4
Weight distributions of two classes of linear codes with five or six weights	4
The maximum number of 10- and 12-cycles in a planar graph	4
Eulerian pairs and Eulerian recurrence systems	4
On Delannoy paths without peaks and valleys	4
The weight spectrum of two families of Reed-Muller codes	4
Inclusion total chromatic number	4
On singleton-type bound of locally repairable codes	4
Digraphs of power maps over finite nilpotent groups	4
Finding an induced path that is not a shortest path	4
Oriented posets, rank matrices and q-deformed Markov numbers	4
Waring numbers over finite commutative local rings	4
Anti-Ramsey number of disjoint union of star-like hypergraphs	4
Large cliques in graphs with high chromatic number	4
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs	4
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	4
A note on the list vertex-arboricity of IC-planar graphs	4
An overview of graph covering and partitioning	4
Competitively orientable complete multipartite graphs	4
Every planar graph with girth at least 5 is (1,9)-colorable	4
A cop-winning strategy on strongly cop-win graphs	4
Path-monochromatic bounded depth rooted trees in (random) tournaments	4
Spectral extremal problem on the square of ℓ-cycle	4
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko	4
Editorial Board	4
Contractible edges and liftable vertices in a 4-connected graph	4
Index of parameters of iterated line graphs	4
The Haglund–Remmel–Wilson identity for set partitions	4
A rooted variant of Stanley's chromatic symmetric function	4
Explicit Δ-edge-coloring of consecutive levels in a divisor lattice	4
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	4
Spectral extrema of 1-planar graphs	4
Turán numbers of general star forests in hypergraphs	4
Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs	4
Minimal linear codes from defining sets over F	4
Homomorphisms of planar (m,n)-colored-mixed graphs to planar targets	4
Signed planar graphs with given circular chromatic numbers	4
Degree conditions for disjoint path covers in digraphs	4
Diameter of a commutation class on reduced words	3
Study of cyclic codes from low differentially uniform functions and its consequences	3
A clique-free pseudorandom subgraph of the pseudo polarity graph	3
k-tree connectivity of line graphs	3
Loop homology of bi-secondary structures	3
Hermitian duality of left dihedral codes over finite fields	3
Editorial Board	3
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three	3
Graphs that admit a Hamilton path are cup-stackable	3
A note on a pair of orthogonal orthomorphisms of cyclic groups	3
Constructions of binary codes with two distances	3
Bender–Knuth involutions on linear extensions of posets	3
Illuminating spiky balls and cap bodies	3
Eigenvalues and toughness of regular graphs	3
Editorial Board	3
Spectral extremal graphs for the bowtie	3
Constraining MC-numbers by the connectivity of complement graphs	3
New MDS codes of non-GRS type and NMDS codes	3
A proof of the symmetric theta trees conjecture when q = 0	3
Edge-colorings avoiding patterns in a triangle	3
A sufficient condition for a graph to be fractional (k,n)-critical	3
Eigenvalues and parity factors in graphs with given minimum degree	3
On the intersection problem for linear sets in the projective line	3
On triangular biregular degree sequences	3
On the sizes of large subgraphs of the binomial random graph	3
Edge DP-coloring of planar graphs without 4-cycles and specific cycles	3
Triangle-degree and triangle-distinct graphs	3
An algorithm for packing hypertrees	3