Discrete Applied Mathematics

Papers
(The H4-Index of Discrete Applied Mathematics is 20. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-11-01 to 2025-11-01.)
ArticleCitations
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]56
Distinguishing graphs via cycles52
On the chromatic number of graphs of odd girth without longer odd holes44
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size43
A new condition on dominated pair degree sum for a digraph to be supereulerian39
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes34
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs28
Super graphs on groups, II28
Bounded-degree light approximate shortest-path trees in doubling metrics28
Minimum length word-representants of word-representable graphs27
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]27
Finding kings in tournaments26
Editorial Board24
Security in Sierpiński graphs24
Graphs with many edge-colorings such that complete graphs are rainbow24
Exact algorithms for counting 3-colorings of graphs23
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 2322
Editorial Board22
Counting independent sets in tricyclic graphs20
Feedback game on 3-chromatic Eulerian triangulations of surfaces20
0.056952953338623