Discrete Applied Mathematics

Article	Citations
On chordal and perfect plane near-triangulations	50
Security in Sierpiński graphs	46
Finding kings in tournaments	42
The multi-returning secretary problem	38
Some results about the inset edge and average distance of trees	35
Antimagic orientation of subdivided caterpillars	33
Exact algorithms for counting 3-colorings of graphs	27
Editorial Board	24
On coloring a class of claw-free and hole-twin-free graphs	24
Rainbow independent sets in graphs with maximum degree two	24
Minimum length word-representants of word-representable graphs	23
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]	23
Counting independent sets in tricyclic graphs	23
Extremal Kirchhoff index in polycyclic chains	22
Independence, matching and packing coloring of the iterated Mycielskian of graphs	21
Super graphs on groups, II	20
On the chromatic number of graphs of odd girth without longer odd holes	18
Flow resistance to resistance ratios in cubic graphs	18
Solution to a problem of Katona on counting cliques of weighted graphs	17
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	17
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	16
A new condition on dominated pair degree sum for a digraph to be supereulerian	16
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	16
Algebraic degree of spectra of Cayley hypergraphs	15
Bounded-degree light approximate shortest-path trees in doubling metrics	15

Multi-objective matroid optimization with ordinal weights	15
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	14
Graphr-hued colorings—A survey	14
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	14
Feedback game on 3-chromatic Eulerian triangulations of surfaces	14
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	14
Graphs with many edge-colorings such that complete graphs are rainbow	14
Parameterized complexity for iterated type partitions and modular-width	14
On exponential type sequences	14
Distinguishing graphs via cycles	13
Flip paths between lattice triangulations	13
Factors, spectral radius and toughness in bipartite graphs	12
The combinatorics of Motzkin polyominoes	12
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	12
Optimal realizations and the block decomposition of a finite metric space	12
On the semi-proper orientations of graphs	11
Editorial Board	11
The algorithm and complexity of secure domination in 3-dimensional box graphs	11
3-path-connectivity of Cayley graphs generated by transposition trees	11
Injective chromatic index of sparse graphs	11
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	11
Induced forests in some distance-regular graphs	10
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph	10
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	10
On claw-free graphs with all but four eigenvalues equal to 0 or −	10
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems	10
Synchronizing dynamic Huffman codes	10
Rainbow triangles in arc-colored digraphs	10
On the cryptographic properties of weightwise affine and weightwise quadratic functions	10
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	10
A note on Hamilton ℓ-cycle decomposition of complete	10
Disproofs of three conjectures on the power domination of graphs	9
Packing coloring of hypercubes with extended Hamming codes	9
Localization game for random graphs	9
General sum-connectivity index of unicyclic graphs with given diameter	9
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices	9
Algorithmic results for weak Roman domination problem in graphs	9
Total k-domination in Cartesian product of complete graphs	9
Packing (1,1	9
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number	9
Query complexity of Boolean functions on the middle slice of the cube	9
Results about the total chromatic number and the conformability of some families of circulant graphs	9
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	9
Regular pattern-free coloring	9
Editorial Board	8
Nonempty intersection of longest paths in graphs without forbidden pairs	8
Graphs with minimum fractional domatic number	8
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	8
Editorial Board	8
Erdös–Gallai-type problems for distance-edge-monitoring numbers	8

Hereditary classes of graphs: A parametric approach	8
Editorial Board	8
The Maker–Maker domination game in forests	8
Automorphism group of a graph related to zero-divisor graphs	8
Zero forcing of generalized hierarchical products	8
Minimum length word-representants of graph products	8
On the vertex stability numbers of graphs	8
New transmission irregular chemical graphs	8
A linear-time algorithm for semitotal domination in strongly chordal graphs	8
Domination related parameters in the generalized lexicographic product of graphs	8
Vertex-critical (P	8
Structural parameterization for minimum conflict-free colouring	8
Some results on (strong) total proper connection number of some digraphs	8
Recursive MDS matrices over finite commutative rings	8
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines	8
A note on Alon–Tarsi number of Halin graphs	8
On the oriented achromatic number of graphs	7
On the Merrifield–Simmons index of tricyclic graphs	7
Characterization of random walks on space of unordered trees using efficient metric simulation	7
Editorial Board	7
Vertex-edge domination in unit disk graphs	7
A tight lower bound on non-adaptive group testing estimation	7
Top to random shuffles on colored permutations	7
Robust two-dose vaccination schemes and the directed b-matching probl	7
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	7
Editorial Board	7
Resistance distance in connected balanced digraphs	7
Sombor index of maximal outerplanar graphs	7
On the structure of essentially-highly-connected polyhedral graphs	7
Algorithmic study on 2-transitivity of graphs	7
Efficient methods of calculating the number of heapable permutations	7
Branchwidth is (1,g	7
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	7
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	7
Extension of some edge graph problems: Standard, parameterized and approximation complexity	7
On some conjectures on biclique graphs	7
Graphs with degree sequence {(	7
Square coloring of planar graphs with maximum degree at most five	7
A characterization of graphs with given total coalition numbers	7
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6
Connectivity and diagnosability of centerk-ary6
Backbone coloring of graphs with galaxy backbones	6
Orientable burning number of graphs	6
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	6
Relating the annihilation number and the total domination number for some graphs	6
Novel bilevel formulations for waste management	6
Truncated metric dimension for finite graphs	6
A new approach to finding the extra connectivity of graphs	6
Disjoint cycles in graphs with restricted independence number	6
Proof of a conjecture on the strong chromatic index of Halin graphs	6
Some relations between the irreducible polynomials over a finite field and its quadratic extension	6
Note on fair game edge-connectivity of graphs	6
Acyclic coloring of products of digraphs	6
Preface: CALDAM 2019	6
On the Wiener index of orientations of graphs	6
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	6
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	6
Self-adhesivity in lattices of abstract conditional independence models	6
On unimodular graphs with a unique perfect matching	6
P3	6
Palindromic factorization of rich words	6
Diverse fair allocations: Complexity and algorithms	6
Essential obstacles to Helly circular-arc graphs	6
On the dominating (induced) cycles of iterated line graphs	6
Kemeny’s constant and Kirchhoffian indices for conjoined highly symmetric graphs	6
Compatibility of partitions with trees, hierarchies, and split systems	6
Probabilistic properties of highly connected random geometric graphs	6
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	6
On monotonicity in Maker–Breaker graph colouring games	6
Minimum degree and size conditions for the graphs of proper connection number 2	6
The linear 2-arboricity of IC-planar graphs	6
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	6
K5,	6
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	6
Algorithms for linear time reconstruction by discrete tomography II	6
An improved bound for 2-distance coloring of planar graphs with girth six	6
Weak degeneracy of planar graphs without 4- and 6-cycles	6
Editorial Board	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6

Covering Italian domination in graphs	5
Two-to-one functions from Galois extensions	5
Finding all minimum cost flows and a faster algorithm for the K best	5
Various matching keys for asymmetric topology encryption	5
Random walks and Laplacians on hypergraphs: When do they match?	5
A 7/3-approxim	5
A compact quadratic model and linearizations for the minimum linear arrangement problem	5
Vertex-arboricity of toroidal graphs without K<	5
On the resistance diameters of graphs and their line graphs	5
Separable and equatable hypergraphs	5
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	5
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	5
Expected polynomial-time randomized algorithm for graph coloring problem	5
New bounds for Ramsey numbers R(	5
Maximum 0-1 timed matching on temporal graphs	5
Minimal trees with respect to exponential Zagreb indices	5
2-tone coloring of cactus graphs	5
The weight balance function on trees	5
A polyhedral model for enumeration and optimization over the set of circuits	5
The iterated local transitivity model for hypergraphs	5
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number	5
2-limited dominating broadcasts on cubic graphs without induced 4-cycles	5
Fibonacci-run graphs II: Degree sequences	5
Target set selection for conservative populations	5
On star 5-colorings of sparse graphs	5
On different versions of the exact subgraph hierarchy for the stable set problem	5
Dips at small sizes for topological graph obstruction sets	5
Cubic and quartic net-regular strongly regular signed graphs	5
On forcibly k-connected and forcibly 5
Strengthened Ore conditions for (s,<	5
Restricted arc-connectivity of unidirectional star graphs	5
The proper 2-connection number and size of graphs	5
Resistance distance and Kirchhoff index in dihedral Cayley graphs	5
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers	5
A local search approximation algorithm for the multiway cut problem	5
On the number of perfect matchings of middle graphs	5
Factors of bi-regular bipartite graphs	5
On the AVDTC of Sierpiński-type graphs	5
Bounds for eccentricity-based parameters of graphs	5
Analysis on Yu et al.’s dynamic algorithm for canonic DBC	5
Fixed points of a random restricted growth sequence	5
Perfect codes in m-Cayley hypergraphs	5
Editorial Board	5
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost	5
Recognizing unit multiple interval graphs is hard	4
Determining equitable total chromatic number for infinite classes of complete r	4
On locally identifying coloring of Cartesian product and tensor product of graphs	4
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts	4
A construction of uniquely colourable graphs with equal colour class sizes	4
On arithmetic sums of Cantor-type sequences of integers	4
(1,1)-Cluster Editing is polynomial-time solvable	4
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes	4
Anti-Ramsey numbers for cycles in n-prisms	4
Remarks on restricted fractional (g,	4
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem	4
Travelling salesman paths on Demidenko matrices	4
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph	4
A note on rainbow-free colorings of uniform hypergraphs	4
Polyhedral properties of the induced cluster subgraphs	4
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints	4
Metric dimension: From graphs to oriented graphs	4
Optimal covering of the equidistant square grid network	4
On k-shifted antimagic spider forests	4
Reconstruction number of graphs with unique pendant vertex	4
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges	4
A quadratic simplex algorithm for primal optimization over zero-one polytopes	4
On cut vertices and eigenvalues of character graphs of solvable groups	4
Extremal problems for connected set enumeration	4
Structural insights about avoiding transfers in the patient-to-room assignment problem	4
Checking the admissibility of odd-vertex pairings is hard	4
Editorial Board	4
γ-variable first-order logic of preferential attachment random graphs	4
An extended hypergraph cut method for the Wiener index	4
Local WL invariance and hidden shades of regularity	4
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels	4
H-sequences and 2-step coreness in graphs	4
Shortest paths with a cost constraint: A probabilistic analysis	4
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph	4
Time-delayed Cops and Robbers	4
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles	4
Algorithm for partial sweep coverage on a line	4
Integral trees with diameter 6	4
Twin-width of graphs with tree-structured decompositions	4
Irreducibility of recombination Markov chains in the triangular lattice	4
Efficient enumeration of dominating sets for sparse graphs	4
The axiomatic characterization of the interval function of distance hereditary graphs	4
Spanning acyclic subdigraphs and strong t-panconnectivity of tournam	4
Modified hyper-Wiener index of trees	4
Metric and ultrametric inequalities for directed graphs	4
On the generalized Helly property of hypergraphs, cliques, and bicliques	4
Leafy spanning arborescences in DAGs	4
The level matrix of a tree and its spectrum	4
Editorial Board	4
On the maximum diversity of hypergraphs with fixed matching number	4
The average Steiner (3,2	4