Discrete Applied Mathematics

Article	Citations
Security in Sierpiński graphs	52
Editorial Board	47
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]	42
Independence, matching and packing coloring of the iterated Mycielskian of graphs	39
Super graphs on groups, II	37
Flow resistance to resistance ratios in cubic graphs	35
Solution to a problem of Katona on counting cliques of weighted graphs	28
On the chromatic number of graphs of odd girth without longer odd holes	28
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	25
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	24
A new condition on dominated pair degree sum for a digraph to be supereulerian	24
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	23
Bounded-degree light approximate shortest-path trees in doubling metrics	23
Parameterized complexity for iterated type partitions and modular-width	22
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	21
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	20
Graphs with many edge-colorings such that complete graphs are rainbow	19
Flip paths between lattice triangulations	18
The combinatorics of Motzkin polyominoes	17
Distinguishing graphs via cycles	17
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	17
Maker–Breaker domination game critical graphs	16
On the semi-proper orientations of graphs	16
The algorithm and complexity of secure domination in 3-dimensional box graphs	16
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	16

Editorial Board	16
A note on Hamilton ℓ-cycle decomposition of complete	15
Injective chromatic index of sparse graphs	15
Feedback game on 3-chromatic Eulerian triangulations of surfaces	15
On chordal and perfect plane near-triangulations	14
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	14
On coloring a class of claw-free and hole-twin-free graphs	14
Minimum length word-representants of word-representable graphs	14
Optimal realizations and the block decomposition of a finite metric space	14
The multi-returning secretary problem	13
Exact algorithms for counting 3-colorings of graphs	12
Some results about the inset edge and average distance of trees	12
Rainbow independent sets in graphs with maximum degree two	12
Finding kings in tournaments	12
Antimagic orientation of subdivided caterpillars	12
Rainbow triangles in arc-colored digraphs	11
Synchronizing dynamic Huffman codes	11
Counting independent sets in tricyclic graphs	11
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	11
Algebraic degree of spectra of Cayley hypergraphs	11
Query complexity of Boolean functions on the middle slice of the cube	10
3-path-connectivity of Cayley graphs generated by transposition trees	10
Multi-objective matroid optimization with ordinal weights	10
Packing coloring of hypercubes with extended Hamming codes	10
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph	10
Graphr-hued colorings—A survey	10
Factors, spectral radius and toughness in bipartite graphs	10
Induced forests in some distance-regular graphs	10
Algorithmic results for weak Roman domination problem in graphs	10
On exponential type sequences	10
Extremal Kirchhoff index in polycyclic chains	10
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	10
Zero forcing of generalized hierarchical products	9
Localization game for random graphs	9
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices	9
Total k-domination in Cartesian product of complete graphs	9
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number	9
On claw-free graphs with all but four eigenvalues equal to 0 or −	9
Results about the total chromatic number and the conformability of some families of circulant graphs	9
Regular pattern-free coloring	9
Vertex-critical (P	9
The Maker–Maker domination game in forests	9
Minimum length word-representants of graph products	9
Disproofs of three conjectures on the power domination of graphs	9
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	9
Automorphism group of a graph related to zero-divisor graphs	9
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems	9
Recursive MDS matrices over finite commutative rings	9
Editorial Board	8
Resistance distance in connected balanced digraphs	8

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	8
Some results on (strong) total proper connection number of some digraphs	8
Packing (1,1	8
Editorial Board	8
Sombor index of maximal outerplanar graphs	8
A tight lower bound on non-adaptive group testing estimation	8
On the vertex stability numbers of graphs	8
Editorial Board	8
On the cryptographic properties of weightwise affine and weightwise quadratic functions	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
A linear-time algorithm for semitotal domination in strongly chordal graphs	8
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods	8
Characterization of random walks on space of unordered trees using efficient metric simulation	8
Erdös–Gallai-type problems for distance-edge-monitoring numbers	8
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	8
New transmission irregular chemical graphs	8
Graphs with minimum fractional domatic number	8
Editorial Board	8
Domination related parameters in the generalized lexicographic product of graphs	8
Editorial Board	8
Diverse fair allocations: Complexity and algorithms	7
Top to random shuffles on colored permutations	7
On the oriented achromatic number of graphs	7
On some conjectures on biclique graphs	7
Vertex-edge domination in unit disk graphs	7
Palindromic factorization of rich words	7
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	7
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	7
K5,	7
Efficient methods of calculating the number of heapable permutations	7
Hereditary classes of graphs: A parametric approach	7
Structural parameterization for minimum conflict-free colouring	7
On the structure of essentially-highly-connected polyhedral graphs	7
Algorithms for linear time reconstruction by discrete tomography II	7
Disjoint cycles in graphs with restricted independence number	7
Minimum degree and size conditions for the graphs of proper connection number 2	7
Branchwidth is (1,g	7
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	7
Extension of some edge graph problems: Standard, parameterized and approximation complexity	7
Square coloring of planar graphs with maximum degree at most five	7
Algorithmic study on 2-transitivity of graphs	7
Truncated metric dimension for finite graphs	7
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	7
Self-adhesivity in lattices of abstract conditional independence models	7
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	6
On the resistance diameters of graphs and their line graphs	6
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree	6
An improved bound for 2-distance coloring of planar graphs with girth six	6
On unimodular graphs with a unique perfect matching	6
A characterization of graphs with given total coalition numbers	6
On the Wiener index of orientations of graphs	6
P3	6
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	6
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	6
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	6
Kemeny’s constant and Kirchhoffian indices for conjoined highly symmetric graphs	6
The linear 2-arboricity of IC-planar graphs	6
Resistance distance and Kirchhoff index in dihedral Cayley graphs	6
On the AVDTC of Sierpiński-type graphs	6
Note on fair game edge-connectivity of graphs	6
Preface: CALDAM 2019	6
On the Merrifield–Simmons index of tricyclic graphs	6
Nonempty intersection of longest paths in graphs without forbidden pairs	6
Graphs with degree sequence {(	6
Editorial Board	6
Dips at small sizes for topological graph obstruction sets	6
Relating the annihilation number and the total domination number for some graphs	6
Acyclic coloring of products of digraphs	6
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
Cubic and quartic net-regular strongly regular signed graphs	6
Probabilistic properties of highly connected random geometric graphs	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6
Compatibility of partitions with trees, hierarchies, and split systems	6
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	6
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	6
Robust two-dose vaccination schemes and the directed b-matching probl	6
Some relations between the irreducible polynomials over a finite field and its quadratic extension	6
On the dominating (induced) cycles of iterated line graphs	6
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6

Proof of a conjecture on the strong chromatic index of Halin graphs	6
Factors of bi-regular bipartite graphs	5
Irreducibility of recombination Markov chains in the triangular lattice	5
A compact quadratic model and linearizations for the minimum linear arrangement problem	5
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts	5
Bounds for eccentricity-based parameters of graphs	5
Priority-based bin packing with subset constraints	5
Maximum 0-1 timed matching on temporal graphs	5
Efficient enumeration of dominating sets for sparse graphs	5
Editorial Board	5
On the maximum diversity of hypergraphs with fixed matching number	5
On the number of perfect matchings of middle graphs	5
The weighted total cophenetic index: A novel balance index for phylogenetic networks	5
Two-to-one functions from Galois extensions	5
Various matching keys for asymmetric topology encryption	5
Weak degeneracy of planar graphs without 4- and 6-cycles	5
Fibonacci-run graphs II: Degree sequences	5
The iterated local transitivity model for hypergraphs	5
A local search approximation algorithm for the multiway cut problem	5
A quadratic simplex algorithm for primal optimization over zero-one polytopes	5
The proper 2-connection number and size of graphs	5
Minimal trees with respect to exponential Zagreb indices	5
Bounds for boxicity of circular clique graphs and zero-divisor graphs	5
Covering Italian domination in graphs	5
Polyhedral properties of the induced cluster subgraphs	5
The weight balance function on trees	5
Metric dimension: From graphs to oriented graphs	5
On monotonicity in Maker–Breaker graph colouring games	5
Integral trees with diameter 6	5
Novel bilevel formulations for waste management	5
Backbone coloring of graphs with galaxy backbones	5
On arithmetic sums of Cantor-type sequences of integers	5
2-limited dominating broadcasts on cubic graphs without induced 4-cycles	5
The level matrix of a tree and its spectrum	5
Target set selection for conservative populations	5
Separable and equatable hypergraphs	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
A polyhedral model for enumeration and optimization over the set of circuits	5
Shortest paths with a cost constraint: A probabilistic analysis	5
Random walks and Laplacians on hypergraphs: When do they match?	5
Time-delayed Cops and Robbers	5
Orientable burning number of graphs	5
Recognizing unit multiple interval graphs is hard	5
Essential obstacles to Helly circular-arc graphs	5
Finding all minimum cost flows and a faster algorithm for the K best	4
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph	4
2-tone coloring of cactus graphs	4
Metric and ultrametric inequalities for directed graphs	4
New constant dimension subspace codes from improved parallel subcode construction	4
Local WL invariance and hidden shades of regularity	4
A construction of uniquely colourable graphs with equal colour class sizes	4
Shortened universal cycles for permutations	4
Borodin–Kostochka conjecture holds for	4
Editorial Board	4
Relations between global forcing number and maximum anti-forcing number of a graph	4
Checking the admissibility of odd-vertex pairings is hard	4
On graphs with maximum average eccentricity	4
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations	4
On cut vertices and eigenvalues of character graphs of solvable groups	4
On k-shifted antimagic spider forests	4
A note on fractional ID-[a,b<	4
γ-variable first-order logic of preferential attachment random graphs	4
New bounds for Ramsey numbers R(	4
A note on rainbow-free colorings of uniform hypergraphs	4
On different versions of the exact subgraph hierarchy for the stable set problem	4
Modified hyper-Wiener index of trees	4
Strengthened Ore conditions for (s,<	4
Bounds on the defect of an octahedron in a rational lattice	4
H-sequences and 2-step coreness in graphs	4
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size	4
Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems	4
The secure domination number of Cartesian products of small graphs with paths and cycles	4
Relaxation of Wegner’s planar graph conjecture for maximum degree 4	4
Bidirectional adaptive compression	4
k-isolation in graphs	4
A 7/3-approxim	4
Remarks on restricted fractional (g,	4
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number	4
Determining equitable total chromatic number for infinite classes of complete r	4
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels	4
Travelling salesman paths on Demidenko matrices	4
Restricted arc-connectivity of unidirectional star graphs	4
Editorial Board	4
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers	4
Integral values of generating functions of recursive sequences	4
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints	4
The average Steiner (3,2	4
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs	4
Spanning acyclic subdigraphs and strong t-panconnectivity of tournam	4
Anti-Ramsey numbers for cycles in n-prisms	4
Degree-based function index for graphs with given diameter	4
On packing S-colorings of subcubic graphs	4
Perfect codes in m-Cayley hypergraphs	4
Line segment disk cover	4