Discrete Applied Mathematics

Article	Citations
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 cycles	52
On the chromatic number of graphs of odd girth without longer odd holes	44
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	43
A new condition on dominated pair degree sum for a digraph to be supereulerian	39
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes	34
Bounded-degree light approximate shortest-path trees in doubling metrics	28
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	28
Super graphs on groups, II	28
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	27
Minimum length word-representants of word-representable graphs	27
Finding kings in tournaments	26
Graphs with many edge-colorings such that complete graphs are rainbow	24
Editorial Board	24
Security in Sierpiński graphs	24
Exact algorithms for counting 3-colorings of graphs	23
Editorial Board	22
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	22
Feedback game on 3-chromatic Eulerian triangulations of surfaces	20
Counting independent sets in tricyclic graphs	20
On chordal and perfect plane near-triangulations	19
On exponential type sequences	19
Injective chromatic index of sparse graphs	19
Some results about the inset edge and average distance of trees	18
Antimagic orientation of subdivided caterpillars	17

On coloring a class of claw-free and hole-twin-free graphs	17
Algebraic degree of spectra of Cayley hypergraphs	17
Solution to a problem of Katona on counting cliques of weighted graphs	17
Flip paths between lattice triangulations	16
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	16
Flow resistance to resistance ratios in cubic graphs	16
Independence, matching and packing coloring of the iterated Mycielskian of graphs	15
Parameterized complexity for iterated type partitions and modular-width	15
Rainbow triangles in arc-colored digraphs	14
Graph r-hued colorings—A survey	14
Factors, spectral radius and toughness in bipartite graphs	14
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	14
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	14
An ordering theorem on the Q-spectral radius of graphs with given siz	13
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem	13
Grundy packing coloring of graphs	13
The combinatorics of Motzkin polyominoes	13
Comparing the p-independence number of regular graphs to the	13
A note on Hamilton ℓ-cycle decomposition of complete	13
Extremal Kirchhoff index in polycyclic chains	12
The multi-returning secretary problem	12
Maker–Breaker domination game critical graphs	12
Rainbow independent sets in graphs with maximum degree two	12
The algorithm and complexity of secure domination in 3-dimensional box graphs	12
On irredundance coloring and irredundance compelling coloring of graphs	12
3-path-connectivity of Cayley graphs generated by transposition trees	12
Multi-objective matroid optimization with ordinal weights	12
Alternating L-functions of finite digraphs	12
k-path-connectivity of the complete balanced tripartite graph	11
Packing coloring of hypercubes with extended Hamming codes	11
Minimum length word-representants of graph products	11
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	11
Some results on the saturation number of graphs	11
On claw-free graphs with all but four eigenvalues equal to 0 or −	11
The Maker–Maker domination game in forests	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
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems	11
Synchronizing dynamic Huffman codes	11
Automorphism group of a graph related to zero-divisor graphs	10
Graceful colorings of graphs with maximum degree three	10
A note on Alon–Tarsi number of Halin graphs	10
Results about the total chromatic number and the conformability of some families of circulant graphs	10
Query complexity of Boolean functions on the middle slice of the cube	10
Zero forcing of generalized hierarchical products	10
Algorithmic results for weak Roman domination problem in graphs	10
Erdös–Gallai-type problems for distance-edge-monitoring numbers	10
Graphs with minimum fractional domatic number	10
Disproofs of three conjectures on the power domination of graphs	10
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	10

Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines	10
Regular pattern-free coloring	10
Induced forests in some distance-regular graphs	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
Unit dual quaternion directed graphs, formation control and general weighted directed graphs	9
Edge addition and the change in Kemeny’s constant	9
Localization game for random graphs	9
Editorial Board	9
Vertex-critical (P	9
Total k-domination in Cartesian product of complete graphs	9
On the vertex stability numbers of graphs	9
Cops and attacking robbers with cycle constraints	9
Recursive MDS matrices over finite commutative rings	9
Editorial Board	9
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	9
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	9
On proper conflict-free colorings of IC-planar graphs	9
On the cryptographic properties of weightwise affine and weightwise quadratic functions	9
New transmission irregular chemical graphs	9
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	8
A linear-time algorithm for semitotal domination in strongly chordal graphs	8
Truncated metric dimension for finite graphs	8
Square coloring of planar graphs with maximum degree at most five	8
Extension of some edge graph problems: Standard, parameterized and approximation complexity	8
Graphs with degree sequence {(	8
Nonempty intersection of longest paths in graphs without forbidden pairs	8
A characterization of graphs with given total coalition numbers	8
On the unimodality of Zhang-Zhang polynomials of parallelogram chains	8
On the Wiener index of orientations of graphs	8
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods	8
Sombor index of maximal outerplanar graphs	8
Minimum degree and size conditions for the graphs of proper connection number 2	8
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	8
On some conjectures on biclique graphs	8
Disjoint cycles in graphs with restricted independence number	8
Diverse fair allocations: Complexity and algorithms	8
On the oriented achromatic number of graphs	8
Robust two-dose vaccination schemes and the directed b-matching probl	8
A tight lower bound on non-adaptive group testing estimation	8
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter	8
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	8
Self-adhesivity in lattices of abstract conditional independence models	8
Structural parameterization for minimum conflict-free colouring	8
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	8
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree	7
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	7
Algorithmic study on 2-transitivity of graphs	7
Editorial Board	7
On the structure of essentially-highly-connected polyhedral graphs	7
Editorial Board	7
Characterization of random walks on space of unordered trees using efficient metric simulation	7
Branchwidth is (1,g	7
K5,	7
Essential obstacles to Helly circular-arc graphs	7
Orientable burning number of graphs	7
Dips at small sizes for topological graph obstruction sets	7
Editorial Board	7
Hereditary classes of graphs: A parametric approach	7
Top to random shuffles on colored permutations	7
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	7
On the Merrifield–Simmons index of tricyclic graphs	7
Efficient methods of calculating the number of heapable permutations	7
Palindromic factorization of rich words	7
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	7
Structure and coloring of (P7	7
Cubic and quartic net-regular strongly regular signed graphs	7
P3	7
Editorial Board	7
Editorial Board	7
Vertex-edge domination in unit disk graphs	7
An improved bound for 2-distance coloring of planar graphs with girth six	7
Resistance distance in connected balanced digraphs	7
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	7
On the number of perfect matchings of middle graphs	7
Integral trees with diameter 6	6
Random walks and Laplacians on hypergraphs: When do they match?	6
On the AVDTC of Sierpiński-type graphs	6
Sharing the losses of a hierarchical venture	6
Backbone coloring of graphs with galaxy backbones	6

Double Roman domination stability in graphs	6
Note on fair game edge-connectivity of graphs	6
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	6
Weak degeneracy of planar graphs without 4- and 6-cycles	6
Acyclic coloring of products of digraphs	6
On the dominating (induced) cycles of iterated line graphs	6
Bounds for boxicity of circular clique graphs and zero-divisor graphs	6
Extremal spectral radius of graphs with cyclic edge-connectivity	6
The weight balance function on trees	6
Novel bilevel formulations for waste management	6
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	6
On monotonicity in Maker–Breaker graph colouring games	6
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph	6
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6
A compact quadratic model and linearizations for the minimum linear arrangement problem	6
Relating the annihilation number and the total domination number for some graphs	6
Covering Italian domination in graphs	6
Compatibility of partitions with trees, hierarchies, and split systems	6
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts	6
On the resistance diameters of graphs and their line graphs	6
An extended hypergraph cut method for the Wiener index	6
Bounds for eccentricity-based parameters of graphs	6
Resistance distance and Kirchhoff index in dihedral Cayley graphs	6
Some relations between the irreducible polynomials over a finite field and its quadratic extension	6
The proper 2-connection number and size of graphs	6
The linear 2-arboricity of IC-planar graphs	6
Preface: CALDAM 2019	6
Probabilistic properties of highly connected random geometric graphs	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6
On unimodular graphs with a unique perfect matching	6
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
The level matrix of a tree and its spectrum	6
Two-to-one functions from Galois extensions	6
Priority-based bin packing with subset constraints	6
Reconstruction number of graphs with unique pendant vertex	5
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels	5
On different versions of the exact subgraph hierarchy for the stable set problem	5
A 7/3-approxim	5
On forcibly k-connected and forcibly 5
Restricted arc-connectivity of unidirectional star graphs	5
The iterated local transitivity model for hypergraphs	5
Extremal results on the spectral radius of function-weighted adjacency matrices	5
A note on fractional ID-[a,b<	5
Expected polynomial-time randomized algorithm for graph coloring problem	5
Irreducibility of recombination Markov chains in the triangular lattice	5
Target set selection for conservative populations	5
Recognizing unit multiple interval graphs is hard	5
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph	5
Perfect matching and distance spectral radius in graphs and bipartite graphs	5
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles	5
A polyhedral model for enumeration and optimization over the set of circuits	5
Minimal trees with respect to exponential Zagreb indices	5
On arithmetic sums of Cantor-type sequences of integers	5
New constant dimension subspace codes from improved parallel subcode construction	5
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers	5
Structural insights about avoiding transfers in the patient-to-room assignment problem	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
The weighted total cophenetic index: A novel balance index for phylogenetic networks	5
Efficient enumeration of dominating sets for sparse graphs	5
A local search approximation algorithm for the multiway cut problem	5
Finding all minimum cost flows and a faster algorithm for the K best	5
Strengthened Ore conditions for (s,<	5
On locally identifying coloring of Cartesian product and tensor product of graphs	5
Algorithm for partial sweep coverage on a line	5
Vertex-arboricity of toroidal graphs without K<	5
Factors of bi-regular bipartite graphs	5
Time-delayed Cops and Robbers	5
Metric dimension: From graphs to oriented graphs	5
2-tone coloring of cactus graphs	5
On k-shifted antimagic spider forests	5
Maximum 0-1 timed matching on temporal graphs	5
Perfect codes in m-Cayley hypergraphs	5
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost	5
New bounds for Ramsey numbers R(	5
A quadratic simplex algorithm for primal optimization over zero-one polytopes	5
On the maximum diversity of hypergraphs with fixed matching number	5
Separable and equatable hypergraphs	5
Various matching keys for asymmetric topology encryption	5
On packing S-colorings of subcubic graphs	4
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation	4
An inductive proof of Dirac’s theorem on Hamilton cycles	4
On the generalized Helly property of hypergraphs, cliques, and bicliques	4
Modified hyper-Wiener index of trees	4
γ-variable first-order logic of preferential attachment random graphs	4
Hybrid intermittent fault diagnosis of general graphs	4
The secure domination number of Cartesian products of small graphs with paths and cycles	4
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes	4
A construction of uniquely colourable graphs with equal colour class sizes	4
Relations between global forcing number and maximum anti-forcing number of a graph	4
Borodin–Kostochka conjecture holds for	4
On cut vertices and eigenvalues of character graphs of solvable groups	4
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size	4
Anti-Ramsey numbers for cycles in n-prisms	4
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs	4