Discrete Applied Mathematics

Article	Citations
Editorial Board	54
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]	51
Independence, matching and packing coloring of the iterated Mycielskian of graphs	43
Super graphs on groups, II	41
Flow resistance to resistance ratios in cubic graphs	39
On the chromatic number of graphs of odd girth without longer odd holes	31
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	28
A new condition on dominated pair degree sum for a digraph to be supereulerian	28
Solution to a problem of Katona on counting cliques of weighted graphs	28
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	28
Bounded-degree light approximate shortest-path trees in doubling metrics	26
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	26
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	23
Flip paths between lattice triangulations	22
Graphs with many edge-colorings such that complete graphs are rainbow	22
Distinguishing graphs via cycles	21
The combinatorics of Motzkin polyominoes	20
On exponential type sequences	19
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	19
Editorial Board	19
On irredundance coloring and irredundance compelling coloring of graphs	18
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	17
Alternating L-functions of finite digraphs	17
The algorithm and complexity of secure domination in 3-dimensional box graphs	17
Feedback game on 3-chromatic Eulerian triangulations of surfaces	17

Maker–Breaker domination game critical graphs	17
Injective chromatic index of sparse graphs	16
A note on Hamilton ℓ-cycle decomposition of complete	15
Grundy packing coloring of graphs	15
Minimum length word-representants of word-representable graphs	15
On coloring a class of claw-free and hole-twin-free graphs	14
Optimal realizations and the block decomposition of a finite metric space	14
The multi-returning secretary problem	14
On chordal and perfect plane near-triangulations	14
Rainbow independent sets in graphs with maximum degree two	13
Rainbow triangles in arc-colored digraphs	13
Counting independent sets in tricyclic graphs	13
Antimagic orientation of subdivided caterpillars	13
Exact algorithms for counting 3-colorings of graphs	13
Synchronizing dynamic Huffman codes	13
Finding kings in tournaments	13
Some results about the inset edge and average distance of trees	13
Factors, spectral radius and toughness in bipartite graphs	13
Graphr-hued colorings—A survey	12
Extremal Kirchhoff index in polycyclic chains	12
Multi-objective matroid optimization with ordinal weights	12
Parameterized complexity for iterated type partitions and modular-width	12
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	12
Security in Sierpiński graphs	12
3-path-connectivity of Cayley graphs generated by transposition trees	12
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	12
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	11
Induced forests in some distance-regular graphs	11
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	11
Algebraic degree of spectra of Cayley hypergraphs	11
Packing coloring of hypercubes with extended Hamming codes	11
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph	11
Algorithmic results for weak Roman domination problem in graphs	11
Query complexity of Boolean functions on the middle slice of the cube	10
Total k-domination in Cartesian product of complete graphs	10
Automorphism group of a graph related to zero-divisor graphs	10
Disproofs of three conjectures on the power domination of graphs	10
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	10
Zero forcing of generalized hierarchical products	10
The Maker–Maker domination game in forests	10
Localization game for random graphs	10
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices	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
Results about the total chromatic number and the conformability of some families of circulant graphs	10
Regular pattern-free coloring	10
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number	9
On the cryptographic properties of weightwise affine and weightwise quadratic functions	9
Editorial Board	9
k-path-connectivity of the complete balanced tripartite graph	9

Vertex-critical (P	9
Minimum length word-representants of graph products	9
Erdös–Gallai-type problems for distance-edge-monitoring numbers	9
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines	9
New transmission irregular chemical graphs	9
Editorial Board	9
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	9
Some results on (strong) total proper connection number of some digraphs	9
A note on Alon–Tarsi number of Halin graphs	9
Graphs with minimum fractional domatic number	9
Characterization of random walks on space of unordered trees using efficient metric simulation	8
Editorial Board	8
Recursive MDS matrices over finite commutative rings	8
On some conjectures on biclique graphs	8
Truncated metric dimension for finite graphs	8
Structural parameterization for minimum conflict-free colouring	8
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	8
Square coloring of planar graphs with maximum degree at most five	8
On the structure of essentially-highly-connected polyhedral graphs	8
A linear-time algorithm for semitotal domination in strongly chordal graphs	8
Editorial Board	8
Some results on the saturation number of graphs	8
On the vertex stability numbers of graphs	8
A tight lower bound on non-adaptive group testing estimation	8
Domination related parameters in the generalized lexicographic product of graphs	8
Sombor index of maximal outerplanar graphs	8
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods	8
On the Merrifield–Simmons index of tricyclic graphs	8
Extension of some edge graph problems: Standard, parameterized and approximation complexity	8
Editorial Board	8
Editorial Board	8
Packing (1,1	8
Unit dual quaternion directed graphs, formation control and general weighted directed graphs	8
Hereditary classes of graphs: A parametric approach	8
Resistance distance in connected balanced digraphs	8
Efficient methods of calculating the number of heapable permutations	8
Robust two-dose vaccination schemes and the directed b-matching probl	8
On the oriented achromatic number of graphs	8
Palindromic factorization of rich words	7
Graphs with degree sequence {(	7
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	7
Disjoint cycles in graphs with restricted independence number	7
On the Wiener index of orientations of graphs	7
Self-adhesivity in lattices of abstract conditional independence models	7
Some relations between the irreducible polynomials over a finite field and its quadratic extension	7
On unimodular graphs with a unique perfect matching	7
On the dominating (induced) cycles of iterated line graphs	7
A characterization of graphs with given total coalition numbers	7
Nonempty intersection of longest paths in graphs without forbidden pairs	7
Branchwidth is (1,g	7
Top to random shuffles on colored permutations	7
Diverse fair allocations: Complexity and algorithms	7
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	7
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	7
Probabilistic properties of highly connected random geometric graphs	7
Preface: CALDAM 2019	7
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	7
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	7
P3	7
K5,	7
Minimum degree and size conditions for the graphs of proper connection number 2	7
Algorithmic study on 2-transitivity of graphs	7
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	7
An improved bound for 2-distance coloring of planar graphs with girth six	7
Note on fair game edge-connectivity of graphs	7
Compatibility of partitions with trees, hierarchies, and split systems	7
Vertex-edge domination in unit disk graphs	7
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	7
Relating the annihilation number and the total domination number for some graphs	6
Novel bilevel formulations for waste management	6
Kemeny’s constant and Kirchhoffian indices for conjoined highly symmetric graphs	6
On the AVDTC of Sierpiński-type graphs	6
Dips at small sizes for topological graph obstruction sets	6
Orientable burning number of graphs	6
A compact quadratic model and linearizations for the minimum linear arrangement problem	6
The linear 2-arboricity of IC-planar graphs	6
Resistance distance and Kirchhoff index in dihedral Cayley graphs	6
Weak degeneracy of planar graphs without 4- and 6-cycles	6
On monotonicity in Maker–Breaker graph colouring games	6
Essential obstacles to Helly circular-arc graphs	6

The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6
Editorial Board	6
On the resistance diameters of graphs and their line graphs	6
Double Roman domination stability in graphs	6
Random walks and Laplacians on hypergraphs: When do they match?	6
The weight balance function on trees	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6
Acyclic coloring of products of digraphs	6
On the number of perfect matchings of middle graphs	6
Cubic and quartic net-regular strongly regular signed graphs	6
Backbone coloring of graphs with galaxy backbones	6
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	6
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	6
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	6
Proof of a conjecture on the strong chromatic index of Halin graphs	6
Structure and coloring of (P7	6
Fibonacci-run graphs II: Degree sequences	6
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree	6
Two-to-one functions from Galois extensions	6
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number	5
On arithmetic sums of Cantor-type sequences of integers	5
Factors of bi-regular bipartite graphs	5
Maximum 0-1 timed matching on temporal graphs	5
Minimal trees with respect to exponential Zagreb indices	5
Fixed points of a random restricted growth sequence	5
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph	5
Structural insights about avoiding transfers in the patient-to-room assignment problem	5
Time-delayed Cops and Robbers	5
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost	5
An extended hypergraph cut method for the Wiener index	5
Restricted arc-connectivity of unidirectional star graphs	5
On different versions of the exact subgraph hierarchy for the stable set problem	5
Priority-based bin packing with subset constraints	5
Perfect codes in m-Cayley hypergraphs	5
2-limited dominating broadcasts on cubic graphs without induced 4-cycles	5
New bounds for Ramsey numbers R(	5
Various matching keys for asymmetric topology encryption	5
Target set selection for conservative populations	5
Covering Italian domination in graphs	5
A quadratic simplex algorithm for primal optimization over zero-one polytopes	5
Efficient enumeration of dominating sets for sparse graphs	5
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels	5
Integral trees with diameter 6	5
Vertex-arboricity of toroidal graphs without K<	5
Metric dimension: From graphs to oriented graphs	5
On forcibly k-connected and forcibly 5
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts	5
Perfect matching and distance spectral radius in graphs and bipartite graphs	5
On k-shifted antimagic spider forests	5
Shortest paths with a cost constraint: A probabilistic analysis	5
The iterated local transitivity model for hypergraphs	5
A note on fractional ID-[a,b<	5
Irreducibility of recombination Markov chains in the triangular lattice	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
Bounds for eccentricity-based parameters of graphs	5
The proper 2-connection number and size of graphs	5
Finding all minimum cost flows and a faster algorithm for the K best	5
Separable and equatable hypergraphs	5
Expected polynomial-time randomized algorithm for graph coloring problem	5
Recognizing unit multiple interval graphs is hard	5
New constant dimension subspace codes from improved parallel subcode construction	5
On the maximum diversity of hypergraphs with fixed matching number	5
Strengthened Ore conditions for (s,<	5
Bounds for boxicity of circular clique graphs and zero-divisor graphs	5
2-tone coloring of cactus graphs	5
A 7/3-approxim	5
The level matrix of a tree and its spectrum	5
On zero-sum free sequences contained in random subsets of finite cyclic groups	4
Degree-based function index for graphs with given diameter	4
Bidirectional adaptive compression	4
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations	4
Connectivity of random hypergraphs with a given hyperedge size distribution	4
Checking the admissibility of odd-vertex pairings is hard	4
Remarks on restricted fractional (g,	4
Solving the problem about the second largest normalized Laplacian eigenvalue	4
Computational complexity of covering disconnected multigraphs	4
Relations between global forcing number and maximum anti-forcing number of a graph	4
On the total version of the covering Italian domination problem	4
Leafy spanning arborescences in DAGs	4
The average Steiner (3,2	4
Relaxation of Wegner’s planar graph conjecture for maximum degree 4	4
On graphs with maximum average eccentricity	4
Editorial Board	4
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation	4
Infinitesimal rigidity and prestress stability for frameworks in normed spaces	4
Neighbor connectivity of pancake graphs and burnt pancake graphs	4
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem	4
Turán problem of signed graph for negative odd cycle	4
γ-variable first-order logic of preferential attachment random graphs	4
Spanning acyclic subdigraphs and strong t-panconnectivity of tournam	4
Line segment disk cover	4
Eccentricity matrix of corona of two graphs	4
An inductive proof of Dirac’s theorem on Hamilton cycles	4