Discrete Mathematics

Article	Citations
Equitable partitions into matchings and coverings in mixed graphs	22
Reconstructibility of a general DNA evolution model	21
A spectral property for concurrent systems and some probabilistic applications	21
On well-dominated direct, Cartesian and strong product graphs	20
Editorial Board	20
Symmetric graphs of prime valency associated with some almost simple groups	19
Editorial Board	19
Remarks on pseudo-vertex-transitive graphs with small diameter	19
Bipartite biregular Moore graphs	18
Four infinite families of chiral 3-polytopes of type {4,8} with solvable automorphism groups	17
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns	16
Difference sets in pseudocyclic association schemes	15
Tiling of rectangles with squares and related problems via Diophantine approximation	15
A new sieve for restricted multiset counting	14
Disjunctive domination in graphs with minimum degree at least two	14
Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊	14
The k-apex trees with minimum augmented Zagreb index	14
Extremal problems and results related to Gallai-colorings	14
Enumeration of permutations by the parity of descent positions	14
Reconfiguration of homomorphisms to reflexive digraph cycles	13
On (1,2)-domination in cubic graphs	12
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs	12
A characterization of graphs with given maximum degree and smallest possible matching number: II	12
Rainbow polygons for colored point sets in the plane	12
A note on the restricted partition function p12

Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences	11
Generalized Turán results for intersecting cliques	11
Constructing flag-transitive, point-primitive 2-designs from complete graphs	11
A note on multicolor Ramsey number of small odd cycles versus a large clique	11
Minor exclusion in quasi-transitive graphs	11
Disjoint properly colored cycles in edge-colored complete bipartite graphs	11
A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices	11
m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes	11
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions	10
Vertex degree sums for matchings in 3-uniform hypergraphs	10
Bounding the Mostar index	10
Holey Schröder designs of type 3u1	10
Flow number and circular flow number of signed cubic graphs	9
Formal self-duality and numerical self-duality for symmetric association schemes	9
Combinatorial properties of multidimensional continued fractions	9
Vertex-bipancyclicity in a bipartite graph collection	9
Modulus for bases of matroids	9
Constructions of AEAQEC codes via matrix-product codes	9
A note on fully commutative elements in complex reflection groups	9
Enumerations of universal cycles for k-permutations	8
Planar graphs without normally adjacent short cycles	8
Algebraic and geometric multiplicities for some hypergraphs	8
Mixed cages: Monotonicity, connectivity and upper bounds	8
On Toeplitz codes of index t and isometry codes	8
The number of P-vertices for acyclic matrices with given nullity	8
Pull-push method: A new approach to edge-isoperimetric problems	8
The inverse eigenvalue problem for linear trees	8
χ-Diperfect digraphs	8
Indicated domination game	8
On 13-crossing-critical graphs with arbitrarily large degrees	7
Progress towards the two-thirds conjecture on locating-total dominating sets	7
Structure of edges in plane graphs with bounded dual edge weight	7
On self-dual skew cyclic codes of length p over F<	7
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices	7
On the generalized A-spectral characterizations of almost α-controllable graphs	7
Local metric dimension for graphs with small clique numbers	7
Corrigendum to “l-LIPs of codes over finite chain rings” [Discrete Math. 345 (12) (2022) 113087]	7
A generalization of the Graham-Pollak tree theorem to Steiner distance	7
Modular Fuss-Catalan numbers	7
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9	7
Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme	7
Counting orientations of graphs with no strongly connected tournaments	7
Spectral strengthening of a theorem on transversal critical graphs	7
About S-packing coloring of subcubic graphs	7
A p-centered coloring for the grid using O(p) colors	7
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs	7
A system of disjoint representatives of line segments with given k directions	7
Note on sunflowers	7
Nullity and singularity of a graph in which every block is a cycle	7
Serial exchanges in matroids	7

Refinements of degree conditions for the existence of a spanning tree without small degree stems	7
On k-anti-traceability of oriented graphs	7
One-generator quasi-cyclic codes and their dual codes	6
Spectral extremal graphs for edge blow-up of star forests	6
Generalized graph splines and the Universal Difference Property	6
Isolation of k-cliques II	6
On the maximum number of maximum dissociation sets in trees with given dissociation number	6
Pinnacle set properties	6
A generalization of Alon–Aydinian–Huang theorem	6
The most general structure of graphs with hamiltonian or hamiltonian connected square	6
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem	6
Connected Q-integral graphs with maximum edge-degree less than or equal to 8	6
Generalized Turán results for edge blow-up of star forests	6
Perfect state transfer on bi-Cayley graphs over abelian groups	6
On the maximum number of edges in planar graphs of bounded degree and matching number	6
Graph realizations: Maximum degree in vertex neighborhoods	6
On 2-factors with long cycles in 3-connected claw-free graphs	6
Extreme and statistical properties of eigenvalue indices of simple connected graphs	6
A q-analogue of the bipartite distance matrix of a nonsingular tree	6
On MDS geometric Fq	6
On two conjectures about the intersection of longest paths and cycles	6
Spanning trees with few branch vertices in K1,4-free graphs	6
Further results on pinnacle sets	6
Editorial Board	6
Cubic graphs have paired-domination number at most four-seventh of their orders	6
A characterization of normal 3-pseudomanifolds with at most two singularities	6
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs	5
On the rank of Suzuki polytopes: An answer to Hubard and Leemans	5
Excluded checkerboard colourable ribbon graph minors	5
Singular graphs and the reciprocal eigenvalue property	5
Almost controllable graphs and beyond	5
On a conjecture about (m1,m2)-near-Skolem sequences	5
Transversal coalitions in hypergraphs	5
On finite groups whose power graph is claw-free	5
Divisibility among power matrices associated with classes of arithmetic functions	5
Decompositions of a rectangle into non-congruent rectangles of equal area	5
Maximal sets of Hamilton cycles in complete multipartite graphs IV	5
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected	5
A characterization of optimal locally repairable codes	5
On d-panconnected tournaments with large semidegrees	5
The inverse of circulant matrices over GF(2 )	5
Editorial Board	5
Adjacent vertex distinguishing total coloring in split graphs	5
The optimal χ-bound for (P7,C4,C5)-free graphs	5
On the zero-sum subsequences of modular restricted lengths	5
Quantum MDS codes with new length and large minimum distance	5
Solvable conjugacy class graph of groups	5
Query complexity of Boolean functions on slices	5
Constructions of Z-optimal Type-II quadriphase Z-complementary pairs	5
Z-knotted and 5
The invertible elements of the monoid of dead-ending misère games	5
The odd girth of generalized Johnson graphs	5
Injective coloring of graphs revisited	5
Improved results on linkage problems	5
On graphs with exactly one anti-adjacency eigenvalue and beyond	5
Improved bounds on the chromatic number of (P5, flag)-free graphs	5
Partitions and well-coveredness: The graph sandwich problem	5
Generalized rainbow Turán numbers of odd cycles	5
Critical Problem for a q-analogue of polymatroids	5
Dot products inFq	5
Spanning 3-strong tournaments in 5-strong semicomplete digraphs	5
On partitions of two-dimensional discrete boxes	5
Covering the edges of a graph with triangles	5
Exact hyperplane covers for subsets of the hypercube	5
Optimal functions with spectral constraints in hypercubes	5
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs	5
A characterisation of Fq	5
On vertex-induced weighted Turán problems	5
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching	5
On the bijective colouring of Cantor trees based on transducers	4
Spectrum of 3-uniform 6- and 9-cycle systems over Kv	4
Intersecting longest paths in chordal graphs	4
The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes	4
Waring numbers over finite commutative local rings	4
Inclusion total chromatic number	4
A cop-winning strategy on strongly cop-win graphs	4
Index of parameters of iterated line graphs	4
On mixed radial Moore graphs of diameter 3	4
A complete classification of edge-primitive graphs of valency 6	4
Weight distributions of two classes of linear codes with five or six weights	4

Explicit exponential lower bounds for exact hyperplane covers	4
A general construction of strictly Neumaier graphs and a related switching	4
Large cliques in graphs with high chromatic number	4
Explicit Δ-edge-coloring of consecutive levels in a divisor lattice	4
A nonuniform Littlewood–Offord inequality for all norms	4
Ordering Q-indices of graphs: Given size and circumference	4
On off-diagonal ordered Ramsey numbers of nested matchings	4
An open problem of k-Galois hulls and its application	4
Every planar graph with girth at least 5 is (1,9)-colorable	4
State transfer on integral mixed circulant graphs	4
Competitively orientable complete multipartite graphs	4
On singleton-type bound of locally repairable codes	4
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen	4
Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs	4
Antimagic labeling for unions of graphs with many three-paths	4
The Turán number of Berge-matching in hypergraphs	4
Minimal linear codes from defining sets over F	4
Finding an induced path that is not a shortest path	4
Yet another proof of Brooks' theorem	4
D-index and 4
The trace reconstruction problem for spider graphs	4
Andrews-Gordon type series for Schur's partition identity	4
Partition identities related to the minimal excludant	4
Editorial Board	4
Improved lower bound on the on-line chain partitioning of semi-orders with representation	4
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4	4
Mixed graphs with smallest eigenvalue greater than −	4
Editorial Board	4
Three classes of BCH codes and their duals	4
Extremal spectral results related to spanning trees of signed complete graphs	4
Forbidden subdigraphs conditions on the Traceability Conjecture	4
An overview of graph covering and partitioning	4
Covering almost all the layers of the hypercube with multiplicities	4
Flag-transitive 2-designs with (r − λ,k)=1 and alternating socle	4
Card shuffling and P-partitions	4
On a ratio of Wiener indices for embedded graphs	4
Homomorphisms of planar (m,n)-colored-mixed graphs to planar targets	4
A note on the list vertex-arboricity of IC-planar graphs	4
Freeness for restriction arrangements of the extended Shi and Catalan arrangements	4
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko	4
On Delannoy paths without peaks and valleys	4
Accumulation points of the edit distance function	4
Degree conditions for disjoint path covers in digraphs	4
Regular graphs of girth 5 from elliptic semiplanes of type C	4
The uncertainty principle over finite fields	4
The effects of semantic simplifications on random BST-like expression-trees	4
Two Hamiltonian cycles	4
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space	4
Path-monochromatic bounded depth rooted trees in (random) tournaments	4
Weak degeneracy of regular graphs	4
Spectral extrema of 1-planar graphs	4
Average mixing in quantum walks of reversible Markov chains	3
An algorithm for packing hypertrees	3
Rotation r-graphs	3
Monochromatic quotients, products and polynomial sums in the rationals	3
On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture	3
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs	3
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas	3
On the sizes of large subgraphs of the binomial random graph	3
Schematic 4-designs	3
Collapsibility of random clique complexes	3
Interval colourable orientations of graphs	3
New MDS codes of non-GRS type and NMDS codes	3
Two classes of few-Lee weight Z2	3
Bender–Knuth involutions on linear extensions of posets	3
A note on a pair of orthogonal orthomorphisms of cyclic groups	3
Eigenvalues and parity factors in graphs with given minimum degree	3
A sufficient condition for a graph to be fractional (k,n)-critical	3
Spectral extremal graphs for the bowtie	3
0-1 Tableaux and the p,q-Legendre-Stirling numbers of the second kind	3
On the intersection problem for linear sets in the projective line	3
The weight hierarchies of linear codes from simplicial complexes	3
Editorial Board	3
Constructions of binary codes with two distances	3
Generalized perfect difference families and their application to variable-weight geometric orthogonal codes	3
A proof of the symmetric theta trees conjecture when q = 0	3
Packing a triangle by equilateral triangles of harmonic sidelengths	3
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three	3
Pebbling in powers of paths	3
Multistage positional games	3
Edge DP-coloring of planar graphs without 4-cycles and specific cycles	3
k-tree connectivity of line graphs	3
A clique-free pseudorandom subgraph of the pseudo polarity graph	3
Edge-fault diameter of C4-free graphs	3
A Hall-type theorem with algorithmic consequences in planar graphs	3
Subfield codes of C-codes over F	3
The problem of path decomposition for graphs with treewidth at most 4	3
Constructions of linear codes with two or three weights from vectorial dual-bent functions	3
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets	3
Illuminating spiky balls and cap bodies	3
Loop homology of bi-secondary structures	3
Graphs that admit a Hamilton path are cup-stackable	3
2¯	3
Properly colored cycles of different lengths in edge-colored complete graphs	3
Rectangular Heffter arrays: a reduction theorem	3