Discrete Applied Mathematics

Article	Citations
Distinguishing graphs via cycles	58
On the chromatic number of graphs of odd girth without longer odd holes	53
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	45
A new condition on dominated pair degree sum for a digraph to be supereulerian	41
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	39
Comparing the p-independence number of regular graphs to the	34
An ordering theorem on the Q-spectral radius of graphs with given siz	33
A note on Hamilton ℓ-cycle decomposition of complete	33
On irredundance coloring and irredundance compelling coloring of graphs	30
Rainbow triangles in arc-colored digraphs	28
Parameterized complexity for iterated type partitions and modular-width	27
Flow resistance to resistance ratios in cubic graphs	27
Algebraic degree of spectra of Cayley hypergraphs	25
Graph r-hued colorings—A survey	25
Multi-objective matroid optimization with ordinal weights	24
Synchronizing dynamic Huffman codes	23
Rainbow independent sets in graphs with maximum degree two	22
Super graphs on groups, II	21
Graphs with many edge-colorings such that complete graphs are rainbow	20
Editorial Board	20
On chordal and perfect plane near-triangulations	19
Security in Sierpiński graphs	19
Some results about the inset edge and average distance of trees	19
Feedback game on 3-chromatic Eulerian triangulations of surfaces	19
Injective chromatic index of sparse graphs	19

Editorial Board	19
On coloring a class of claw-free and hole-twin-free graphs	18
A proof of a version of Griggs and Yeh’s conjecture for L	17
Flip paths between lattice triangulations	17
The algorithm and complexity of secure domination in 3-dimensional box graphs	17
Independence, matching and packing coloring of the iterated Mycielskian of graphs	17
Alternating L-functions of finite digraphs	17
The multi-returning secretary problem	16
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	16
Moving through Cartesian products, coronas and joins in general position	15
On exponential type sequences	15
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]	15
On essential independent sets in graphs	15
Counting independent sets in tricyclic graphs	15
Grundy packing coloring of graphs	15
Extremal oriented graphs avoiding 1-subdivision of an in-star	15
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	15
Minimum length word-representants of word-representable graphs	14
3-path-connectivity of Cayley graphs generated by transposition trees	14
Construction of regular homogeneously traceable nonhamiltonian graphs	14
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem	14
Finding kings in tournaments	14
Characterization of double-arborescences and their minimum length word-representants	14
The combinatorics of Motzkin polyominoes	13
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	13
Distance spectral radius and edge-disjoint spanning trees	13
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	13
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	13
Extremal Kirchhoff index in polycyclic chains	12
Factors, spectral radius and toughness in bipartite graphs	12
On the integer sets with identical representation functions	12
Solution to a problem of Katona on counting cliques of weighted graphs	12
Fair link contributions for values of network cooperative games	11
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	11
On claw-free graphs with all but four eigenvalues equal to 0 or −	11
Maker–Breaker domination game critical graphs	11
Exact algorithms for counting 3-colorings of graphs	11
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter	11
A decomposition structure of resonance graphs that are daisy cubes	11
A word reconstruction problem for polynomial regular languages	11
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph	11
Some results on (strong) total proper connection number of some digraphs	11
A note on Alon–Tarsi number of Halin graphs	10
Editorial Board	10
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	10
Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable	10
Graceful colorings of graphs with maximum degree three	10
Query complexity of Boolean functions on the middle slice of the cube	10
k-path-connectivity of the complete balanced tripartite graph	10
Cops and attacking robbers with cycle constraints	10

Vertex-critical (P	10
Zero forcing of generalized hierarchical products	10
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems	10
Regular pattern-free coloring	9
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices	9
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number	9
Erdös–Gallai-type problems for distance-edge-monitoring numbers	9
The Maker–Maker domination game in forests	9
Unit dual quaternion directed graphs, formation control and general weighted directed graphs	9
New transmission irregular chemical graphs	9
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	9
Induced forests in some distance-regular graphs	9
Graphs with minimum fractional domatic number	9
On proper conflict-free colorings of IC-planar graphs	9
Total k-domination in Cartesian product of complete graphs	9
On the vertex stability numbers of graphs	9
Editorial Board	9
Edge addition and the change in Kemeny’s constant	9
Voting profiles admitting all candidates as knockout winners	9
Automorphism group of a graph related to zero-divisor graphs	9
k-edge-Hamilton-laceable bipartite graphs	9
Algorithmic results for weak Roman domination problem in graphs	8
On the cryptographic properties of weightwise affine and weightwise quadratic functions	8
The smallest normalized signless ∞	8
Extremal graphs for the sum of the first two largest signless Laplacian eigenvalues	8
Scheduling sports tournaments with two court types	8
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods	8
Hereditary classes of graphs: A parametric approach	8
On the oriented achromatic number of graphs	8
Minimum length word-representants of graph products	8
{	8
Results about the total chromatic number and the conformability of some families of circulant graphs	8
Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products	8
Distribution of the null coefficients of the differential polynomial of the tree graphs	8
A tight lower bound on non-adaptive group testing estimation	8
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	8
Extension of some edge graph problems: Standard, parameterized and approximation complexity	8
Robust two-dose vaccination schemes and the directed b-matching probl	8
Some results on the saturation number of graphs	8
The Maximum Independent Set problem on circulant graphs	8
Graph-theoretic characterization of rings: Outer multiset dimension of zero-divisor graphs	8
Packing coloring of hypercubes with extended Hamming codes	8
Weighted efficient domination for	8
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	8
Minimum degree and size conditions for the graphs of proper connection number 2	8
Lines on digraphs of low diameter	7
Editorial Board	7
Characterization of random walks on space of unordered trees using efficient metric simulation	7
Vertex-edge domination in unit disk graphs	7
An improved bound for 2-distance coloring of planar graphs with girth six	7
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	7
Efficient methods of calculating the number of heapable permutations	7
Editorial Board	7
On the Wiener index of orientations of graphs	7
Signless Laplacian energy and spectral radius of a graph	7
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	7
Algorithmic study on 2-transitivity of graphs	7
On the vertices belonging to all edge metric bases	7
Self-adhesivity in lattices of abstract conditional independence models	7
On some conjectures on biclique graphs	7
Disjoint cycles in graphs with restricted independence number	7
P3	7
Diverse fair allocations: Complexity and algorithms	7
On the structure of essentially-highly-connected polyhedral graphs	7
On the unimodality of Zhang-Zhang polynomials of parallelogram chains	7
The cyclic diagnosability of (	7
On the Merrifield–Simmons index of tricyclic graphs	7
Branchwidth is (1,g	7
A characterization of graphs with given total coalition numbers	7
Graphs with degree sequence {(	7
Structural parameterization for minimum conflict-free colouring	7
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	7
Resistance distance in connected balanced digraphs	7
K5,	7
Top to random shuffles on colored permutations	7
Square coloring of planar graphs with maximum degree at most five	7
Sombor index of maximal outerplanar graphs	7
On the dominating (induced) cycles of iterated line graphs	6
A compact quadratic model and linearizations for the minimum linear arrangement problem	6
Note on fair game edge-connectivity of graphs	6

Double Roman domination stability in graphs	6
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	6
Truncated metric dimension for finite graphs	6
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph	6
A linear-time algorithm for semitotal domination in strongly chordal graphs	6
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	6
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	6
Orientable burning number of graphs	6
Triangle-free graphs with large minimum common degree	6
On monotonicity in Maker–Breaker graph colouring games	6
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6
Common matching number of a graph	6
Some relations between the irreducible polynomials over a finite field and its quadratic extension	6
Dips at small sizes for topological graph obstruction sets	6
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	6
Commutative rings with unit graphs of small vertex-arboricity	6
Corrigendum to “2-Factors in 1-Tough Graphs Whose Independence Number Exceeds the Vertex-Connectivity” [Discrete Appl. Math. 377 (2025) 162–169]	6
Editorial Board	6
The size and	6
Relating the annihilation number and the total domination number for some graphs	6
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	6
Extremal spectral radius of graphs with cyclic edge-connectivity	6
The path-factors and generalized distance spectral radius of graphs	6
Acyclic coloring of products of digraphs	6
Preface: CALDAM 2019	6
On unimodular graphs with a unique perfect matching	6
Essential obstacles to Helly circular-arc graphs	6
Weak degeneracy of planar graphs without 4- and 6-cycles	6
Palindromic factorization of rich words	6
Fault tolerance for metric dimension and its variants	6
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6
Structure and coloring of (	6
Sharing the losses of a hierarchical venture	6
On the AVDTC of Sierpiński-type graphs	6
Perfect codes in m-Cayley hypergraphs	5
Compatibility of partitions with trees, hierarchies, and split systems	5
The linear 2-arboricity of IC-planar graphs	5
Random walks and Laplacians on hypergraphs: When do they match?	5
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree	5
2-limited dominating broadcasts on cubic graphs without induced 4-cycles	5
2-tone coloring of cactus graphs	5
Time-delayed Cops and Robbers	5
Factors of bi-regular bipartite graphs	5
A local search approximation algorithm for the multiway cut problem	5
Reconstruction of segmentationally distributive space from its metric	5
The weighted total cophenetic index: A novel balance index for phylogenetic networks	5
Integral trees with diameter 6	5
Various matching keys for asymmetric topology encryption	5
The weight balance function on trees	5
On k-shifted antimagic spider forests	5
Welfare loss in connected resource allocation	5
Hamiltonicity and bipancyclicity of balanced bipartite digraphs	5
Novel bilevel formulations for waste management	5
A quadratic simplex algorithm for primal optimization over zero-one polytopes	5
Bip-ordered bipartite Ramsey number	5
Priority-based bin packing with subset constraints	5
Degree conditions for disjoint path covers in graphs	5
On different versions of the exact subgraph hierarchy for the stable set problem	5
On the maximum diversity of hypergraphs with fixed matching number	5
Several graph properties in terms of the multiplicative version of the first Zagreb index	5
Structural insights about avoiding transfers in the patient-to-room assignment problem	5
The level matrix of a tree and its spectrum	5
On arithmetic sums of Cantor-type sequences of integers	5
Bounds for eccentricity-based parameters of graphs	5
Restricted arc-connectivity of unidirectional star graphs	5
Cubic and quartic net-regular strongly regular signed graphs	5
On the number of perfect matchings of middle graphs	5
On the roots of independent domination polynomials of graphs	5
Backbone coloring of graphs with galaxy backbones	5
A 7/3-approxim	5
Gracefulness of two nested cycles: A first approach	5
A survey of online knapsack problems	5
The proper 2-connection number and size of graphs	5
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems	5
Extremal results on the spectral radius of function-weighted adjacency matrices	5
Recognizing unit multiple interval graphs is hard	5
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers	5
An extended hypergraph cut method for the Wiener index	5
Turán problem of signed graph for negative odd cycle	4
Eccentricity matrix of corona of two graphs	4
On Hamiltonian bypasses in orgraphs with large semi-degrees	4
On z-coloring and b	4
Partitioning vertices of graphs into paths of the same length	4
Hamilton-connected claw-free graphs with small parameters	4
Twin-width of graphs with tree-structured decompositions	4
Bidirectional adaptive compression	4
Recursive characterization of maximal bipartite planar graphs	4
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem	4
Optimization tools for computing colorings of [1	4
(1,1)-Cluster Editing is polynomial-time solvable	4
Random coordination mechanism for scheduling games with machine modification	4
Integral values of generating functions of recursive sequences	4
Editorial Board	4
Degree-based function index for graphs with given diameter	4