Discrete Mathematics

Article	Citations
Editorial Board	29
Editorial Board	25
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	25
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	25
Tiling of rectangles with squares and related problems via Diophantine approximation	24
Difference sets in pseudocyclic association schemes	23
The k-apex trees with minimum augmented Zagreb index	20
Disjunctive domination in graphs with minimum degree at least two	19
A characterization of graphs with given maximum degree and smallest possible matching number: II	19
Enumeration of permutations by the parity of descent positions	19
A note on multicolor Ramsey number of small odd cycles versus a large clique	18
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	18
Constructing flag-transitive, point-primitive 2-designs from complete graphs	16
Disjoint properly colored cycles in edge-colored complete bipartite graphs	16
Minor exclusion in quasi-transitive graphs	15
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	15
On Toeplitz codes of index t and isometry codes	14
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	14
Holey Schröder designs of type 3u1	14
Vertex degree sums for matchings in 3-uniform hypergraphs	14
Combinatorial properties of multidimensional continued fractions	13
A note on the restricted partition function p12
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	12
The signless Laplacian spectral radius of book-free graphs	12
Extremal problems and results related to Gallai-colorings	12

Formal self-duality and numerical self-duality for symmetric association schemes	12
Enumerations of universal cycles for k-permutations	12
Constructions of AEAQEC codes via matrix-product codes	12
Flow number and circular flow number of signed cubic graphs	11
Reconstructibility of a general DNA evolution model	11
Remarks on pseudo-vertex-transitive graphs with small diameter	11
Symmetric graphs of prime valency associated with some almost simple groups	11
A note on fully commutative elements in complex reflection groups	11
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	11
Bipartite biregular Moore graphs	10
Generalized Turán results for intersecting cliques	10
Turán number of complete bipartite graphs with bounded matching number	10
Equitable partitions into matchings and coverings in mixed graphs	10
Vertex-bipancyclicity in a bipartite graph collection	9
Modulus for bases of matroids	9
Spectral strengthening of a theorem on transversal critical graphs	9
Bounding the Mostar index	9
On well-dominated direct, Cartesian and strong product graphs	9
A system of disjoint representatives of line segments with given k directions	9
Nullity and singularity of a graph in which every block is a cycle	9
On (1,2)-domination in cubic graphs	9
The number of P-vertices for acyclic matrices with given nullity	9
Serial exchanges in matroids	9
Local metric dimension for graphs with small clique numbers	8
Progress towards the two-thirds conjecture on locating-total dominating sets	8
Algebraic and geometric multiplicities for some hypergraphs	8
Modular Fuss-Catalan numbers	8
Perfect state transfer on bi-Cayley graphs over abelian groups	8
Pull-push method: A new approach to edge-isoperimetric problems	8
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	8
Refinements of degree conditions for the existence of a spanning tree without small degree stems	8
A p-centered coloring for the grid using O(p) colors	8
Indicated domination game	8
Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme	8
Mixed cages: Monotonicity, connectivity and upper bounds	8
On MDS geometric Fq	8
Spectral extremal graphs for edge blow-up of star forests	7
Counting orientations of graphs with no strongly connected tournaments	7
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	7
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	7
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	7
Extreme and statistical properties of eigenvalue indices of simple connected graphs	7
Spanning trees with few branch vertices in K1,4-free graphs	7
On k-anti-traceability of oriented graphs	7
On the generalized A-spectral characterizations of almost α-controllable graphs	7
About S-packing coloring of subcubic graphs	7
On two conjectures about the intersection of longest paths and cycles	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
The most general structure of graphs with hamiltonian or hamiltonian connected square	7

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	7
Planar graphs without normally adjacent short cycles	7
On self-dual skew cyclic codes of length p over F<	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
A characterization of normal 3-pseudomanifolds with at most two singularities	7
Generalized graph splines and the Universal Difference Property	7
Partitions and well-coveredness: The graph sandwich problem	6
Optimal functions with spectral constraints in hypercubes	6
Ordering Q-indices of graphs: Given size and circumference	6
On 2-factors with long cycles in 3-connected claw-free graphs	6
Editorial Board	6
The inverse eigenvalue problem for linear trees	6
A generalization of the Graham-Pollak tree theorem to Steiner distance	6
Graph realizations: Maximum degree in vertex neighborhoods	6
Query complexity of Boolean functions on slices	6
Excluded checkerboard colourable ribbon graph minors	6
Covering the edges of a graph with triangles	6
On d-panconnected tournaments with large semidegrees	6
A generalization of Alon–Aydinian–Huang theorem	6
On vertex-induced weighted Turán problems	6
The odd girth of generalized Johnson graphs	6
Generalized Turán results for edge blow-up of star forests	6
On the maximum number of maximum dissociation sets in trees with given dissociation number	6
A characterisation of Fq	6
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	6
The invertible elements of the monoid of dead-ending misère games	6
On the saturation spectrum of the unions of disjoint cycles	6
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	6
Adjacent vertex distinguishing total coloring in split graphs	6
Maximal sets of Hamilton cycles in complete multipartite graphs IV	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
The inverse of circulant matrices over GF(2 )	6
The effects of semantic simplifications on random BST-like expression-trees	6
Further results on pinnacle sets	6
Isolation of k-cliques II	6
Editorial Board	6
Pinnacle set properties	6
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	6
Transversal coalitions in hypergraphs	6
A characterization of optimal locally repairable codes	6
Quantum MDS codes with new length and large minimum distance	5
On mixed radial Moore graphs of diameter 3	5
Divisibility among power matrices associated with classes of arithmetic functions	5
Intersecting families with covering number five	5
Singular graphs and the reciprocal eigenvalue property	5
Solvable conjugacy class graph of groups	5
Critical Problem for a q-analogue of polymatroids	5
The optimal χ-bound for (P7,C4,C5)-free graphs	5
Homomorphisms of planar (m,n)-colored-mixed graphs to planar targets	5
On singleton-type bound of locally repairable codes	5
Yet another proof of Brooks' theorem	5
Almost controllable graphs and beyond	5
Covering almost all the layers of the hypercube with multiplicities	5
A safeness condition for minimal separators based on vertex connectivity	5
Dot products inFq	5
On the zero-sum subsequences of modular restricted lengths	5
Spanning 3-strong tournaments in 5-strong semicomplete digraphs	5
Generalized rainbow Turán numbers of odd cycles	5
Exact hyperplane covers for subsets of the hypercube	5
Injective coloring of graphs revisited	5
Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs	5
State transfer on integral mixed circulant graphs	5
Improved lower bound on the on-line chain partitioning of semi-orders with representation	5
On finite groups whose power graph is claw-free	5
Improved bounds on the chromatic number of (P5, flag)-free graphs	5
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	5
On graphs with exactly one anti-adjacency eigenvalue and beyond	5
On partitions of two-dimensional discrete boxes	5
On a conjecture about (m1,m2)-near-Skolem sequences	5
Constructions of Z-optimal Type-II quadriphase Z-complementary pairs	5
Forbidden subdigraphs conditions on the Traceability Conjecture	5
The Turán number of Berge-matching in hypergraphs	5
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	5
Spectral extrema of 1-planar graphs	5
Improved results on linkage problems	5
Every planar graph with girth at least 5 is (1,9)-colorable	4
Extremal spectral results related to spanning trees of signed complete graphs	4
Spectrum of 3-uniform 6- and 9-cycle systems over Kv	4

Three classes of BCH codes and their duals	4
A note on the list vertex-arboricity of IC-planar graphs	4
Index of parameters of iterated line graphs	4
Cyclic balanced sampling plans excluding contiguous units with block size four	4
The maximum A-spectral radius of t-connected graphs with bounded matching number	4
The Haglund–Remmel–Wilson identity for set partitions	4
Poset positional games	4
Andrews-Gordon type series for Schur's partition identity	4
Editorial Board	4
Tournaments with maximal decomposability	4
Minor obstructions for apex-pseudoforests	4
Non-jumping Turán densities of hypergraphs	4
Two Hamiltonian cycles	4
Another tight description of faces in plane triangulations with minimum degree 4	4
A complete classification of edge-primitive graphs of valency 6	4
Signed planar graphs with given circular chromatic numbers	4
A general construction of strictly Neumaier graphs and a related switching	4
List star edge coloring of generalized Halin graphs	4
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	4
Eulerian pairs and Eulerian recurrence systems	4
Turán numbers of general star forests in hypergraphs	4
Antimagic labeling for unions of graphs with many three-paths	4
On the spum and sum-diameter of paths	4
The trace reconstruction problem for spider graphs	4
Digraphs of power maps over finite nilpotent groups	4
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	4
Minimal linear codes from defining sets over F	4
Mixed graphs with smallest eigenvalue greater than −	4
Weight distributions of two classes of linear codes with five or six weights	4
Partition identities related to the minimal excludant	4
Enumeration of perfect matchings of the middle graph of a graph G with △(G)≤4	4
Large cliques in graphs with high chromatic number	4
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs	4
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4	4
Inclusion total chromatic number	4
q-ary (1,k)-overlap-free codes with given restrictions	4
An open problem of k-Galois hulls and its application	4
Editorial Board	4
Tree evolution processes for bucket increasing trees	4
Contractible edges and liftable vertices in a 4-connected graph	4
The maximum number of 10- and 12-cycles in a planar graph	4
On off-diagonal ordered Ramsey numbers of nested matchings	4
On a colored Turán problem of Diwan and Mubayi	4
Competitively orientable complete multipartite graphs	4
Wickets in 3-uniform hypergraphs	4
Degree conditions for disjoint path covers in digraphs	4
Light 3-stars in embedded graphs	4
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	4
Corrigendum to “On the sum of the first two largest signless Laplacian eigenvalues of a graph” [Discrete Math. 347 (2024) 114035]	4
On Delannoy paths without peaks and valleys	4
Editorial Board	4
D-index and 4
Induced saturation for complete bipartite posets	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
Accumulation points of the edit distance function	4
The weight spectrum of two families of Reed-Muller codes	4
Group action approaches in Erdős quotient set problem	4
An overview of graph covering and partitioning	4
Cyclic balanced sampling plans avoiding adjacent units with block size four	4
Weak star-Drazin and Drazin-star matrices	4
Path-monochromatic bounded depth rooted trees in (random) tournaments	4
On the bijective colouring of Cantor trees based on transducers	4
On the domination number of graphs with minimum degree at least seven	4
Editorial Board	4
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime	4
Recolouring weakly chordal graphs and the complement of triangle-free graphs	4
Weak degeneracy of regular graphs	4
Subcubic planar graphs of girth 7 are class I	4
A cop-winning strategy on strongly cop-win graphs	4
The uncertainty principle over finite fields	4
Spectral extremal problem on the square of ℓ-cycle	4
Intersecting longest paths in chordal graphs	4
On integral graphs which belong to the class α	4
Waring numbers over finite commutative local rings	4
Oriented posets, rank matrices and q-deformed Markov numbers	4
On a ratio of Wiener indices for embedded graphs	4
Anti-Ramsey number of disjoint union of star-like hypergraphs	4
On subgraphs of tripartite graphs	3
The Tamari block lattice: An order on saturated chains in the Tamari lattice	3
The maximum degree of a minimally hamiltonian-connected graph	3
Pebbling in powers of paths	3
Two classes of few-Lee weight Z2	3
Waiter-Client clique-factor game	3
Alternating groups and flag-transitive non-symmetric 2-(v,k,λ) designs with λ ≥ (r,λ)2	3
Parity considerations for drops in cycles on {1,2,…,n}	3
Properly colored cycles of different lengths in edge-colored complete graphs	3
A rank of partitions with overline designated summands	3
The product of two high-frequency Graph Laplacian eigenfunctions is smooth	3
Super-simple group divisible designs with block size 4 and index λ = 7,8	3
On certain partition bijections related to Euler's partition problem	3
On hexavalent half-arc-transitive bi-dihedrants	3
On graphic elementary lifts of graphic matroids	3
Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions	3
Linear codes and incidence structures of bent functions and their generalizations	3