Discrete Mathematics

Article	Citations
α-Diperfect digraphs	18
On a pair of orthogonal golf designs	17
A family of counterexamples for a conjecture of Berge on α-diperfect digraphs	16
On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids	16
Semicomplete compositions of digraphs	16
Constructions of linear codes with two or three weights from vectorial dual-bent functions	16
Global rigidity of (quasi-)injective frameworks on the line	15
On well-dominated direct, Cartesian and strong product graphs	15
An upper bound on the number of frequency hypercubes	14
Pebbling in powers of paths	14
On the f-vectors of r-multichain subdivisions	14
Rainbow polygons for colored point sets in the plane	14
2-Factors of cubic bipartite graphs	14
On the Holroyd-Talbot conjecture for sparse graphs	14
Maniplexes with automorphism group PSL(2,q)	14
Holey Schröder designs of type 3u1	13
Long cycles through specified vertices	13
Tiling of rectangles with squares and related problems via Diophantine approximation	13
Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles	13
No Laplacian perfect state transfer in total graphs	13
On dominating set polyhedra of circular interval graphs	12
Implications in rainbow forbidden subgraphs	12
The relation between composability and splittability of permutation classes	12
Induced subgraphs of zero-divisor graphs	12
Diameter of a commutation class on reduced words	11

On restricted matching extension of 1-embeddable graphs in surfaces with small genus	11
Riordan arrays and r-Stirling number identities	11
On hexavalent half-arc-transitive bi-dihedrants	11
On a property of 2-connected graphs and Dirac's Theorem	11
On the spectral radius of graphs without a gem	11
Editorial Board	11
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	10
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	10
Totally odd immersions in line graphs	9
The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs	9
Constructions of AEAQEC codes via matrix-product codes	9
Cover and variable degeneracy	9
Constructions of binary codes with two distances	9
New upper bounds on the number of non-zero weights of constacyclic codes	9
Doubling constants and spectral theory on graphs	9
On the multiplicity of the least signless Laplacian eigenvalue of a graph	8
Enumerations of universal cycles for k-permutations	8
Editorial Board	8
Disjunctive domination in graphs with minimum degree at least two	8
Nonsingular splittings of cyclic groups	8
On (1,2)-domination in cubic graphs	8
Diameter, edge-connectivity, and C4-freeness	8
Symmetric bi-Cayley graphs on nonabelian simple groups with prime valency	8
Editorial Board	8
Cyclic codes over a non-chain ring R, and their application to LCD codes	8
Pinnacle sets of signed permutations	8
The component counts of random functions	8
On the dimer problem of the vertex-edge graph of a cubic graph	7
Two completely independent spanning trees of claw-free graphs	7
Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k	7
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	7
The chromatic index of graphs with large even order n and minimum degree at least 2n/3	7
Almost simple groups with socle PSp4(q) as flag-transitive automorphism groups of symmetric designs	7
A new sieve for restricted multiset counting	7
Turán number of special four cycles in triple systems	7
Editorial Board	7
On critical graphs for the chromatic edge-stability number	7
Choice number of Kneser graphs	7
Group divisible designs with block size 4 where the group sizes are congruent to 1 mod 3	7
Collapsibility of random clique complexes	7
Constructing few-weight linear codes and strongly regular graphs	6
The polynomial reconstruction problem: The first 50 years	6
A characterization of graphs with given maximum degree and smallest possible matching number: II	6
An Erdős–Fuchs type result for representation functions	6
A spectral version of Mantel's theorem	6
The spectral radius of graphs with no intersecting odd cycles	6
The reconstruction conjecture for finite simple graphs and associated directed graphs	6
A spectral property for concurrent systems and some probabilistic applications	6
Editorial Board	6
IB-homogeneous graphs	6

On the smallest trees with the same restricted U-polynomial and the r	6
Improvements on Hippchen's conjecture	6
Artin-Schreier curves given by F	6
The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one	6
Symmetric graphs of prime valency associated with some almost simple groups	6
Parity considerations for drops in cycles on {1,2,…,n}	6
Construction and enumeration of left dihedral codes satisfying certain duality properties	6
New MDS EAQECCs derived from constacyclic codes over F	6
Laplacian eigenvalue distribution and diameter of graphs	6
Characterizing immutable sandpiles: A first look	5
Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊	5
On the König–Hall–Egerváry theorem for multidimensional matrices and multipartite hypergraphs	5
Connected k-factors in bipartite graphs	5
Words that almost commute	5
Existence of a spanning tree having small diameter	5
Disjoint properly colored cycles in edge-colored complete bipartite graphs	5
Trees with minimum number of infima closed sets	5
The maximum size of a nonhamiltonian graph with given order and connectivity	5
Edge-girth-regular graphs arising from biaffine planes and Suzuki groups	5
A generalization of descent polynomials	5
Reconstructibility of a general DNA evolution model	5
A combinatorial basis for Terwilliger algebra modules of a bipartite distance-regular graph	5
A short note on graphs with long Thomason chains	5
A rank of partitions with overline designated summands	5
Decreasing the maximum degree of a graph	5
Hamiltonian line graphs with local degree conditions	5
Star factorizations and noncrossing partitions	5
On subgraphs of tripartite graphs	5
Alternating groups and flag-transitive non-symmetric 2-(v,k,λ) designs with λ ≥ (r,λ)2	5
Great-circle tree thrackles	5
Hermitian duality of left dihedral codes over finite fields	5
Signed Langford sequences	5
A zeta function related to the transition matrix of the discrete-time quantum walk on a graph	5
Convexly independent subsets of Minkowski sums of convex polygons	5
Planar graphs having no proper 2-immersions in the plane. III	5
Flow number and circular flow number of signed cubic graphs	5
Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap	5
A lower bound on the saturation number, and graphs for which it is sharp	5
Constructing cospectral graphs via regular rational orthogonal matrices with level two	5
On the clique behavior and Hellyness of the complements of regular graphs	5
Atomic weights and the combinatorial game of bipass	5
On the number of equivalence classes arising from partition involutions II	5
On certain partition bijections related to Euler's partition problem	5
The γ-positive coefficients arising in segmented permutations	4
Dirac's theorem on chordal graphs implies Brooks' theorem	4
A large family of cospectral Cayley graphs over dicyclic groups	4
On the cycle isolation number of triangle-free graphs	4
Generation and new infinite families of K2-hypohamiltonian graphs	4
On linear complementary pairs of algebraic geometry codes over finite fields	4
On automorphism groups of a biplane (121,16,2)	4
Standard Young tableaux in a (2,	4
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	4
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs	4
Partial γ-positivity for quasi-Stirling permutations of multisets	4
A Lucas-type congruence for q-Delannoy numbers	4
Euclidean algorithm for a class of linear orders	4
On quasi-strongly regular graphs with parameters (n	4
Upper bounds on positional Paris–Harrington games	4
Generalized Turán results for intersecting cliques	4
Decompositions of line graphs of complete graphs into paths and cycles	4
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three	4
Anti-Ramsey number of matchings in a hypergraph	4
Arc reversals of cycles in orientations of G vertex-multiplications	4
Super-simple group divisible designs with block size 4 and index λ = 7,8	4
Cops and robbers on 2K2-free graphs	4
Independence equivalence classes of cycles	4
Equitable partitions into matchings and coverings in mixed graphs	4
Study of cyclic codes from low differentially uniform functions and its consequences	4
The spectral property of hypergraph coverings	4
On the girth of forbidden subgraphs of coloring graphs	4
On the full Brouwer's Laplacian spectrum conjecture	4
Editorial Board	4
Infinite family of nonschurian separable association schemes	4
The Tamari block lattice: An order on saturated chains in the Tamari lattice	4
Asymptotic behaviour of the containment of certain mesh patterns	4
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three	4
On the functional graph of the power map over finite groups	4
On the lower bound for the length of minimal codes	4
On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs	4
d-fold partition diamonds	4

Strictly balanced uniform hypergraphs and generalizations of Zero-One Law	4
On the maximum number of minimal codewords	4
Nonexistence of some ternary linear codes	4
Poset Ramsey number R(P,Q). III. Chain compositions and antichains	4
Reconfiguration of homomorphisms to reflexive digraph cycles	4
Two shorter proofs on the inverse and differential spectrum of Bracken-Leander exponent	4
Sparse critical graphs for defective DP-colorings	4
Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes	4
Extended path partition conjecture for semicomplete and acyclic compositions	4
DNA codes over finite local Frobenius non-chain rings of length 4	4
Towards the Chen-Raspaud conjecture	4
Characterizations of the set of integer points in an integral bisubmodular polyhedron	3
A note on fully commutative elements in complex reflection groups	3
Remarks on pseudo-vertex-transitive graphs with small diameter	3
On Toeplitz codes of index t and isometry codes	3
Properly colored cycles of different lengths in edge-colored complete graphs	3
The structure of maximal non-trivial d-wise intersecting uniform families with large sizes	3
Some results on k-Turán-good graphs	3
Reconstructibility of the K-count from n − 1 cards	3
Striking patterns in natural magic squares’ associated electrostatic potentials: Matrices of the 4th and 5th order	3
Fractional revival on Cayley graphs over abelian groups	3
Sufficient condition for (α,β) Somos 4 Hankel determinants	3
Minor exclusion in quasi-transitive graphs	3
Decycling cubic graphs	3
A characterization of well-dominated Cartesian products	3
On the sizes of large subgraphs of the binomial random graph	3
Explicit congruences for k-marked Durfee symbols	3
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees	3
The spectrum of resolvable Bose triple systems	3
Enumeration of permutations by the parity of descent positions	3
The edge colorings of K5	3
On the automorphism groups of Lunardon-Polverino scattered linear sets	3
Pinnacle sets revisited	3
On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues	3
Editorial Board	3
Ramsey numbers of several K, and a large K,	3
Upper bounds on the acyclic chromatic index of degenerate graphs	3
Spectral characterization of the complete graph removing a path: Completing the proof of Cámara–Haemers Conjecture	3
An upper bound of the number of distinct powers in binary words	3
Rigid block and hole graphs with a single block	3
Combinatorial properties of multidimensional continued fractions	3
Badges and rainbow matchings	3
Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than	3
Hamilton cycles passing through a matching in a bipartite graph with high degree sum	3
Permutation binomials over finite fields	3
Translating between the representations of a ranked convex geometry	3
A tight bound for conflict-free coloring in terms of distance to cluster	3
Minimal obstructions to (∞,k	3
Rainbow spanning trees in random subgraphs of dense regular graphs	3
Connectivity keeping trees in 3-connected or 3-edge-connected graphs	3
Solving linear equations in a vector space over a finite field	3
Resolutions of the designs in two infinite series of 4-designs	3
Spectra of quasi-strongly regular graphs	3
A class of two or three weights linear codes and their complete weight enumerators	3
On the volume of projections of the cross-polytope	3
Extremal problems and results related to Gallai-colorings	3
Generalised dual Seidel switching and Deza graphs with strongly regular children	3
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture	3
Difference schemes of strength t over finite commutative rings	3
Refinements of Beck-type partition identities	3
Unions of random trees and applications	3
Rectangular Heffter arrays: a reduction theorem	3
Skip letters for short supersequence of all permutations	3
Locating-dominating sets: From graphs to oriented graphs	3
Record-setters in the Stern sequence	3
Edge-colorings avoiding patterns in a triangle	3
Linear codes and incidence structures of bent functions and their generalizations	3
Product-free sets in approximate subgroups of distal groups	3
On the forcing matching numbers of prisms of graphs	3
The product of two high-frequency Graph Laplacian eigenfunctions is smooth	3
Two new characterizations of path graphs	3
Binary color-coded magic squares: A study of uniqueness under rotation/reflection, PCA, and LDA analysis	3
An (increasing) sequence of lower bounds for the spectral radius and energy of digraphs	3
Bipartite biregular Moore graphs	3
Hat chromatic number of graphs	3
Chordality of locally semicomplete and weakly quasi-transitive digraphs	3
Vertex degree sums for matchings in 3-uniform hypergraphs	3
Modulo orientations with bounded out-degrees	3
On vertex in-out-antimagic total digraphs	3
Coarse geometry of the cops and robber game	3
Two classes of few-Lee weight Z2	3
Constraining MC-numbers by the connectivity of complement graphs	3
Star-critical Ramsey numbers involving graphs with long suspended paths	3
The group Cp4	3
Ramsey numbers of large books and bipartite graphs with small bandwidth	3
Broadcasting on paths and cycles	3
On the chromatic number of some P5-free graphs	3
The maximum degree of a minimally hamiltonian-connected graph	3
The k-apex trees with minimum augmented Zagreb index	3
Graphs with n	3
Split graphs and block representations	3
Logical labeling schemes	3
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	3
Large cycles in random generalized Johnson graphs	3
The maximum size of an edge 2-neighborhood in P5-free graphs	3