Discrete Mathematics

Article	Citations
Constructions of linear codes with two or three weights from vectorial dual-bent functions	21
Global rigidity of (quasi-)injective frameworks on the line	19
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids	19
On well-dominated direct, Cartesian and strong product graphs	19
On the Holroyd-Talbot conjecture for sparse graphs	18
Maniplexes with automorphism group PSL(2,q)	17
No Laplacian perfect state transfer in total graphs	17
Pebbling in powers of paths	17
On the f-vectors of r-multichain subdivisions	17
Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles	16
Editorial Board	16
Induced subgraphs of zero-divisor graphs	16
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	15
Constructions of binary codes with two distances	15
Brooks-type theorems for relaxations of square colorings	14
Editorial Board	14
New upper bounds on the number of non-zero weights of constacyclic codes	14
Constructions of AEAQEC codes via matrix-product codes	14
Doubling constants and spectral theory on graphs	14
Cover and variable degeneracy	14
On the multiplicity of the least signless Laplacian eigenvalue of a graph	13
Nonsingular splittings of cyclic groups	13
Choice number of Kneser graphs	12
Editorial Board	12
Rainbow spanning trees in random subgraphs of dense regular graphs	12

Diameter, edge-connectivity, and C4-freeness	12
The chromatic index of graphs with large even order n and minimum degree at least 2n/3	12
Almost simple groups with socle PSp4(q) as flag-transitive automorphism groups of symmetric designs	12
The component counts of random functions	12
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	11
IB-homogeneous graphs	11
Editorial Board	11
Collapsibility of random clique complexes	11
Turán number of special four cycles in triple systems	11
Editorial Board	10
New MDS EAQECCs derived from constacyclic codes over F	10
Construction and enumeration of left dihedral codes satisfying certain duality properties	10
On subgraphs of tripartite graphs	9
The reconstruction conjecture for finite simple graphs and associated directed graphs	9
A spectral property for concurrent systems and some probabilistic applications	9
Symmetric graphs of prime valency associated with some almost simple groups	9
Great-circle tree thrackles	9
The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one	9
A generalization of descent polynomials	8
Words that almost commute	8
Reconstructibility of a general DNA evolution model	8
Hamiltonian line graphs with local degree conditions	8
Hermitian duality of left dihedral codes over finite fields	8
Decreasing the maximum degree of a graph	8
Edge-girth-regular graphs arising from biaffine planes and Suzuki groups	8
Flow number and circular flow number of signed cubic graphs	8
Signed Langford sequences	8
On linear complementary pairs of algebraic geometry codes over finite fields	7
A lower bound on the saturation number, and graphs for which it is sharp	7
Independence equivalence classes of cycles	7
On the automorphism groups of Lunardon-Polverino scattered linear sets	7
DNA codes over finite local Frobenius non-chain rings of length 4	7
A note on fully commutative elements in complex reflection groups	7
Planar graphs having no proper 2-immersions in the plane. III	7
Characterizing immutable sandpiles: A first look	7
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	7
On the lower bound for the length of minimal codes	7
Euclidean algorithm for a class of linear orders	7
On the cycle isolation number of triangle-free graphs	7
A rank of partitions with overline designated summands	7
Equitable partitions into matchings and coverings in mixed graphs	7
Convexly independent subsets of Minkowski sums of convex polygons	7
An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs	7
Combinatorial properties of multidimensional continued fractions	7
Decompositions of line graphs of complete graphs into paths and cycles	6
Rectangular Heffter arrays: a reduction theorem	6
Properly colored cycles of different lengths in edge-colored complete graphs	6
Sufficient condition for (α,β) Somos 4 Hankel determinants	6
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three	6
On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues	6

Skip letters for short supersequence of all permutations	6
Towards the Chen-Raspaud conjecture	6
On the girth of forbidden subgraphs of coloring graphs	6
Bipartite biregular Moore graphs	6
A characterization of well-dominated Cartesian products	6
Two new characterizations of path graphs	6
On the functional graph of the power map over finite groups	6
An upper bound of the number of distinct powers in binary words	6
The edge colorings of K5	6
Two shorter proofs on the inverse and differential spectrum of Bracken-Leander exponent	6
Modulo orientations with bounded out-degrees	6
Difference schemes of strength t over finite commutative rings	6
Reconstructibility of the K-count from n − 1 cards	6
Resolutions of the designs in two infinite series of 4-designs	6
On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs	6
Extended path partition conjecture for semicomplete and acyclic compositions	6
Strictly balanced uniform hypergraphs and generalizations of Zero-One Law	6
Spectra of quasi-strongly regular graphs	6
Editorial Board	6
The maximum degree of a minimally hamiltonian-connected graph	5
d-fold partition diamonds	5
Edge DP-coloring of planar graphs without 4-cycles and specific cycles	5
Asymptotically good LCD 2-quasi-abelian codes over finite fields	5
Two classes of few-Lee weight Z2	5
The group Cp4	5
On the largest and least eigenvalues of eccentricity matrix of trees	5
Cyclic codes over a non-chain ring R, and their application to LCD codes	5
Logical labeling schemes	5
Bounding the Mostar index	5
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees	5
Linear codes and incidence structures of bent functions and their generalizations	5
Locating-dominating sets: From graphs to oriented graphs	5
A spectral version of Mantel's theorem	5
Fractional revival on Cayley graphs over abelian groups	5
Generalized Schröder paths arising from a combinatorial interpretation of generalized Laurent bi-orthogonal polynomials	5
A class of two or three weights linear codes and their complete weight enumerators	5
Some orientation theorems for restricted DP-colorings of graphs	5
Connectivity of the reduced power graphs of finite simple groups	5
A note on distinguishing trees with the chromatic symmetric function	5
Product-free sets in approximate subgroups of distal groups	5
Editorial Board	5
Two completely independent spanning trees of claw-free graphs	5
Constructing cospectral graphs via regular rational orthogonal matrices with level two	5
On a partition identity of Lehmer	5
Average mixing in quantum walks of reversible Markov chains	5
A note on a pair of orthogonal orthomorphisms of cyclic groups	5
The spum and sum-diameter of graphs: Labelings of sum graphs	5
Remarks on pseudo-vertex-transitive graphs with small diameter	5
New infinite families of near MDS codes holding t-designs	5
On triangular biregular degree sequences	5
Pattern-restricted permutations composed of 3-cycles	5
On the sizes of large subgraphs of the binomial random graph	5
Broadcasting on paths and cycles	5
On the full Brouwer's Laplacian spectrum conjecture	5
Constructing few-weight linear codes and strongly regular graphs	4
The spectrum of resolvable Bose triple systems	4
Atomic weights and the combinatorial game of bipass	4
On flag-transitive automorphism groups of 2-designs	4
Artin-Schreier curves given by F	4
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	4
Counting polynomials with distinct zeros in Galois ring GR(p2,r)	4
A Lucas-type congruence for q-Delannoy numbers	4
Determinantal decomposition of graphs with a unique perfect matching	4
Pinnacle sets of signed permutations	4
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture	4
Binary color-coded magic squares: A study of uniqueness under rotation/reflection, PCA, and LDA analysis	4
Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than	4
Semicomplete compositions of digraphs	4
Difference sets in pseudocyclic association schemes	4
The product of two high-frequency Graph Laplacian eigenfunctions is smooth	4
Coarse geometry of the cops and robber game	4
Connected k-factors in bipartite graphs	4
On the dimer problem of the vertex-edge graph of a cubic graph	4
Hamiltonicity of certain vertex-transitive graphs revisited	4
Spectral radius and spanning trees of graphs	4
The isomorphism of generalized Cayley graphs on finite non-abelian simple groups	4
Riordan arrays and r-Stirling number identities	4
Disjunctive domination in graphs with minimum degree at least two	4
On critical graphs for the chromatic edge-stability number	4
Disjoint properly colored cycles in edge-colored complete bipartite graphs	4

The Turán number for the edge blow-up of trees: The missing case	4
Generalized Turán results for intersecting cliques	4
On odd colorings of planar graphs	4
The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs	4
An upper bound on the number of frequency hypercubes	4
The maximum size of a nonhamiltonian graph with given order and connectivity	4
Triangle-degree and triangle-distinct graphs	4
A plurality problem with three colors and query size three	4
A family of counterexamples for a conjecture of Berge on α-diperfect digraphs	4
Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected	4
Holey Schröder designs of type 3u1	4
Refinements of Beck-type partition identities	4
On the clique behavior and Hellyness of the complements of regular graphs	4
The structure of maximal non-trivial d-wise intersecting uniform families with large sizes	4
Group divisible designs with block size 4 where the group sizes are congruent to 1 mod 3	4
Galois self-dual extended duadic constacyclic codes	4
Near MDS codes of non-elliptic-curve type from Reed-Solomon codes	4
Characterize group distance magic labeling of Cartesian product of two cycles	4
The polynomial reconstruction problem: The first 50 years	4
Enumeration of permutations by the parity of descent positions	4
Hamilton cycles passing through a matching in a bipartite graph with high degree sum	4
The k-apex trees with minimum augmented Zagreb index	4
Evasive subspaces, generalized rank weights and near MRD codes	4
On a pair of orthogonal golf designs	4
Graphs of scramble number two	4
Rigid block and hole graphs with a single block	4
Tiling of rectangles with squares and related problems via Diophantine approximation	4
Waiter-Client clique-factor game	4
Symmetric bi-Cayley graphs on nonabelian simple groups with prime valency	4
Split graphs and block representations	3
Diameter of a commutation class on reduced words	3
Sparse critical graphs for defective DP-colorings	3
Cops and robbers on 2K2-free graphs	3
Laplacian eigenvalue distribution and diameter of graphs	3
Some results on k-Turán-good graphs	3
Partial γ-positivity for quasi-Stirling permutations of multisets	3
Dirac's theorem on chordal graphs implies Brooks' theorem	3
On the maximum number of distinct intersections in an intersecting family	3
Cubic vertex-transitive graphs of girth six	3
A note on the restricted partition function p3
Existence of a spanning tree having small diameter	3
Ramsey numbers of several K, and a large K,	3
Star factorizations and noncrossing partitions	3
Rainbow polygons for colored point sets in the plane	3
Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap	3
A tight bound for conflict-free coloring in terms of distance to cluster	3
On graphic elementary lifts of graphic matroids	3
Ramsey numbers of large books and bipartite graphs with small bandwidth	3
Enumerations of universal cycles for k-permutations	3
Edge-colorings avoiding patterns in a triangle	3
Large optimal cyclic subspace codes	3
Nonexistence of linear codes meeting the Griesmer bound	3
Upper bounds on the acyclic chromatic index of degenerate graphs	3
Poset Ramsey number R(P,Q). III. Chain compositions and antichains	3
Explicit congruences for k-marked Durfee symbols	3
On (1,2)-domination in cubic graphs	3
Generation and new infinite families of K2-hypohamiltonian graphs	3
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	3
A characterization of graphs with given maximum degree and smallest possible matching number: II	3
Splits with forbidden subgraphs	3
Trees with minimum number of infima closed sets	3
On dominating set polyhedra of circular interval graphs	3
Parity considerations for drops in cycles on {1,2,…,n}	3
On the number of equivalence classes arising from partition involutions II	3
On the forcing matching numbers of prisms of graphs	3
Hat chromatic number of graphs	3
A new sieve for restricted multiset counting	3
Asymptotic behaviour of the containment of certain mesh patterns	3
Extremal problems and results related to Gallai-colorings	3
Arc reversals of cycles in orientations of G vertex-multiplications	3
Anti-Ramsey number of matchings in a hypergraph	3
On the chromatic number of some P5-free graphs	3
Pinnacle sets revisited	3
Factor-of-iid Schreier decorations of lattices in Euclidean spaces	3
Splitting fields of some matrices of normal (mixed) Cayley graphs	3
Study of cyclic codes from low differentially uniform functions and its consequences	3
Vertex degree sums for matchings in 3-uniform hypergraphs	3
Improvements on Hippchen's conjecture	3
The maximum size of an edge 2-neighborhood in P5-free graphs	3
Vertex-bipancyclicity in a bipartite graph collection	3
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves	3
Hamiltonicity of 1-tough (P2 ∪ kP1)-free graphs	3
A note on multicolor Ramsey number of small odd cycles versus a large clique	3
A zeta function related to the transition matrix of the discrete-time quantum walk on a graph	3
The Tamari block lattice: An order on saturated chains in the Tamari lattice	3
On automorphism groups of a biplane (121,16,2)	3
Large cycles in random generalized Johnson graphs	3
2-Factors of cubic bipartite graphs	3
Nonexistence of some ternary linear codes	3
α-Diperfect digraphs	3
Super-simple group divisible designs with block size 4 and index λ = 7,8	3
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs	3
Decycling cubic graphs	3
On the König–Hall–Egerváry theorem for multidimensional matrices and multipartite hypergraphs	3
The spectral radius of graphs with no intersecting odd cycles	3