Discrete Applied Mathematics

Article	Citations
Distinguishing graphs via cycles	55
On the chromatic number of graphs of odd girth without longer odd holes	53
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	45
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	37
Rainbow independent sets in graphs with maximum degree two	34
Editorial Board	33
Super graphs on groups, II	33
Graphs with many edge-colorings such that complete graphs are rainbow	30
Security in Sierpiński graphs	28
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	27
Editorial Board	27
Feedback game on 3-chromatic Eulerian triangulations of surfaces	24
On chordal and perfect plane near-triangulations	23
Injective chromatic index of sparse graphs	22
Solution to a problem of Katona on counting cliques of weighted graphs	22
Some results about the inset edge and average distance of trees	22
On coloring a class of claw-free and hole-twin-free graphs	20
A proof of a version of Griggs and Yeh’s conjecture for L	20
Flip paths between lattice triangulations	20
Independence, matching and packing coloring of the iterated Mycielskian of graphs	19
3-path-connectivity of Cayley graphs generated by transposition trees	19
Factors, spectral radius and toughness in bipartite graphs	19
Distance spectral radius and edge-disjoint spanning trees	19
An ordering theorem on the Q-spectral radius of graphs with given siz	18

Comparing the p-independence number of regular graphs to the	18
On irredundance coloring and irredundance compelling coloring of graphs	17
A note on Hamilton ℓ-cycle decomposition of complete	17
Synchronizing dynamic Huffman codes	16
Rainbow triangles in arc-colored digraphs	16
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	16
Flow resistance to resistance ratios in cubic graphs	16
Counting independent sets in tricyclic graphs	15
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem	15
Maker–Breaker domination game critical graphs	15
Multi-objective matroid optimization with ordinal weights	15
Alternating L-functions of finite digraphs	14
Exact algorithms for counting 3-colorings of graphs	14
Finding kings in tournaments	14
The algorithm and complexity of secure domination in 3-dimensional box graphs	14
Characterization of double-arborescences and their minimum length word-representants	14
Grundy packing coloring of graphs	14
The multi-returning secretary problem	14
Minimum length word-representants of word-representable graphs	14
A word reconstruction problem for polynomial regular languages	13
Algebraic degree of spectra of Cayley hypergraphs	13
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]	13
Parameterized complexity for iterated type partitions and modular-width	13
On exponential type sequences	13
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	13
Graph r-hued colorings—A survey	13
On essential independent sets in graphs	12
Fair link contributions for values of network cooperative games	12
Extremal oriented graphs avoiding 1-subdivision of an in-star	12
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	12
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	12
Extremal Kirchhoff index in polycyclic chains	11
Construction of regular homogeneously traceable nonhamiltonian graphs	11
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph	11
Antimagic orientation of subdivided caterpillars	11
Moving through Cartesian products, coronas and joins in general position	11
On the integer sets with identical representation functions	11
The combinatorics of Motzkin polyominoes	11
The Maximum Independent Set problem on circulant graphs	10
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter	10
On claw-free graphs with all but four eigenvalues equal to 0 or −	10
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs	10
A decomposition structure of resonance graphs that are daisy cubes	10
Some results on (strong) total proper connection number of some digraphs	10
Query complexity of Boolean functions on the middle slice of the cube	10
{	10
Results about the total chromatic number and the conformability of some families of circulant graphs	10
Zero forcing of generalized hierarchical products	10
Extremal graphs for the sum of the first two largest signless Laplacian eigenvalues	9
A note on Alon–Tarsi number of Halin graphs	9

Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices	9
Some results on the saturation number of graphs	9
Graphs with minimum fractional domatic number	9
New transmission irregular chemical graphs	9
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection	9
Total k-domination in Cartesian product of complete graphs	9
Graceful colorings of graphs with maximum degree three	9
k-path-connectivity of the complete balanced tripartite graph	9
Vertex-critical (P	9
Regular pattern-free coloring	9
Induced forests in some distance-regular graphs	9
Editorial Board	9
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity	8
Distribution of the null coefficients of the differential polynomial of the tree graphs	8
Robust two-dose vaccination schemes and the directed b-matching probl	8
Minimum length word-representants of graph products	8
Unit dual quaternion directed graphs, formation control and general weighted directed graphs	8
On proper conflict-free colorings of IC-planar graphs	8
k-edge-Hamilton-laceable bipartite graphs	8
On the cryptographic properties of weightwise affine and weightwise quadratic functions	8
The Maker–Maker domination game in forests	8
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods	8
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs	8
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules	8
Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products	8
Voting profiles admitting all candidates as knockout winners	8
Algorithmic results for weak Roman domination problem in graphs	8
Packing coloring of hypercubes with extended Hamming codes	8
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems	8
Edge addition and the change in Kemeny’s constant	8
Cops and attacking robbers with cycle constraints	8
On the vertex stability numbers of graphs	8
A tight lower bound on non-adaptive group testing estimation	8
Minimum degree and size conditions for the graphs of proper connection number 2	8
Scheduling sports tournaments with two court types	8
Graph-theoretic characterization of rings: Outer multiset dimension of zero-divisor graphs	8
The smallest normalized signless ∞	8
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles	8
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number	8
Automorphism group of a graph related to zero-divisor graphs	8
Editorial Board	8
Erdös–Gallai-type problems for distance-edge-monitoring numbers	8
Weighted efficient domination for	8
On the oriented achromatic number of graphs	8
Extension of some edge graph problems: Standard, parameterized and approximation complexity	8
Efficient methods of calculating the number of heapable permutations	7
Editorial Board	7
Algorithmic study on 2-transitivity of graphs	7
On some conjectures on biclique graphs	7
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms	7
P3	7
Hereditary classes of graphs: A parametric approach	7
Structural parameterization for minimum conflict-free colouring	7
On the vertices belonging to all edge metric bases	7
Fault tolerance for metric dimension and its variants	7
Branchwidth is (1,g	7
On the structure of essentially-highly-connected polyhedral graphs	7
Graphs with degree sequence {(	7
Diverse fair allocations: Complexity and algorithms	7
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition	7
Resistance distance in connected balanced digraphs	7
A linear-time algorithm for semitotal domination in strongly chordal graphs	7
K5,	7
On the Merrifield–Simmons index of tricyclic graphs	7
Lines on digraphs of low diameter	7
Editorial Board	7
Top to random shuffles on colored permutations	7
Vertex-edge domination in unit disk graphs	7
Disjoint cycles in graphs with restricted independence number	7
An improved bound for 2-distance coloring of planar graphs with girth six	7
A characterization of graphs with given total coalition numbers	7
Self-adhesivity in lattices of abstract conditional independence models	7
Characterization of random walks on space of unordered trees using efficient metric simulation	7
Truncated metric dimension for finite graphs	7
On monotonicity in Maker–Breaker graph colouring games	6
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations	6
Dips at small sizes for topological graph obstruction sets	6
Relating the annihilation number and the total domination number for some graphs	6
Cubic and quartic net-regular strongly regular signed graphs	6
Compatibility of partitions with trees, hierarchies, and split systems	6

Weak degeneracy of planar graphs without 4- and 6-cycles	6
On unimodular graphs with a unique perfect matching	6
On the unimodality of Zhang-Zhang polynomials of parallelogram chains	6
Signless Laplacian energy and spectral radius of a graph	6
A compact quadratic model and linearizations for the minimum linear arrangement problem	6
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph	6
Extremal spectral radius of graphs with cyclic edge-connectivity	6
Some relations between the irreducible polynomials over a finite field and its quadratic extension	6
On the Wiener index of orientations of graphs	6
Double Roman domination stability in graphs	6
Preface: CALDAM 2019	6
Essential obstacles to Helly circular-arc graphs	6
Combinatorial approach of unified Apostol-type polynomials using α-dis	6
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G	6
Palindromic factorization of rich words	6
Square coloring of planar graphs with maximum degree at most five	6
Sombor index of maximal outerplanar graphs	6
The cyclic diagnosability of (	6
Structure and coloring of (	6
Sharing the losses of a hierarchical venture	6
On the AVDTC of Sierpiński-type graphs	6
On the dominating (induced) cycles of iterated line graphs	6
Backbone coloring of graphs with galaxy backbones	6
Note on fair game edge-connectivity of graphs	6
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups	6
Acyclic coloring of products of digraphs	6
Common matching number of a graph	6
Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles	6
Commutative rings with unit graphs of small vertex-arboricity	6
Editorial Board	6
A single machine scheduling with generalized and periodic due dates to minimize total deviation	6
Orientable burning number of graphs	6
Triangle-free graphs with large minimum common degree	6
Integral trees with diameter 6	5
A 7/3-approxim	5
Novel bilevel formulations for waste management	5
Bip-ordered bipartite Ramsey number	5
The path-factors and generalized distance spectral radius of graphs	5
On the maximum diversity of hypergraphs with fixed matching number	5
Time-delayed Cops and Robbers	5
Priority-based bin packing with subset constraints	5
The iterated local transitivity model for hypergraphs	5
A local search approximation algorithm for the multiway cut problem	5
Bounds for eccentricity-based parameters of graphs	5
2-limited dominating broadcasts on cubic graphs without induced 4-cycles	5
The level matrix of a tree and its spectrum	5
On arithmetic sums of Cantor-type sequences of integers	5
An extended hypergraph cut method for the Wiener index	5
Random walks and Laplacians on hypergraphs: When do they match?	5
Welfare loss in connected resource allocation	5
Recognizing unit multiple interval graphs is hard	5
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions	5
Degree conditions for disjoint path covers in graphs	5
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems	5
An improved upper bound on the queue number of the folded hypercube	5
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers	5
The weight balance function on trees	5
2-tone coloring of cactus graphs	5
The linear 2-arboricity of IC-planar graphs	5
Structural insights about avoiding transfers in the patient-to-room assignment problem	5
Hamiltonicity and bipancyclicity of balanced bipartite digraphs	5
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree	5
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching	5
On the number of perfect matchings of middle graphs	5
A quadratic simplex algorithm for primal optimization over zero-one polytopes	5
Determinantal representations of enumerative polynomials	5
Maximum 0-1 timed matching on temporal graphs	5
Various matching keys for asymmetric topology encryption	5
The proper 2-connection number and size of graphs	5
Irreducibility of recombination Markov chains in the triangular lattice	5
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts	5
Metric dimension: From graphs to oriented graphs	5
Leafy spanning arborescences in DAGs	4
Eccentricity matrix of corona of two graphs	4
Incorporating predictions in online graph coloring algorithms	4
Partitioning vertices of graphs into paths of the same length	4
On z-coloring and b	4
Degree-based function index for graphs with given diameter	4
A note on rainbow-free colorings of uniform hypergraphs	4
Modified hyper-Wiener index of trees	4
Factors of bipartite graphs with degree conditions imposed on each partite set	4
Shortened universal cycles for permutations	4
Recursive characterization of maximal bipartite planar graphs	4
Optimization tools for computing colorings of [1	4
Editorial Board	4
Bounds on the defect of an octahedron in a rational lattice	4
On the generalized Helly property of hypergraphs, cliques, and bicliques	4
The axiomatic characterization of the interval function of distance hereditary graphs	4
Metallic cubes are the resonance graphs of phenylenes	4
Checking the admissibility of odd-vertex pairings is hard	4
On Hamiltonian bypasses in orgraphs with large semi-degrees	4
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem	4
On a conjecture by Sylwia Cichacz and Tomasz Hinc, and a related problem	4
H-sequences and 2-step coreness in graphs	4
Anti-Ramsey numbers for cycles in n-prisms	4