Discrete Applied Mathematics

Article	Citations
FPT algorithms for packing k-safe spanning rooted sub(di)graphs	49
Minimum length word-representants of word-representable graphs	42
On the Nash number and the diminishing Grundy number of a graph	37
Planar median graphs and cubesquare-graphs	35
Mutual-visibility in strong products of graphs via total mutual-visibility	31
On the rainbow planar Turán number of double stars	24
On the total version of the covering Italian domination problem	22
An improved algorithm for finding maximum outerplanar subgraphs	21
Algebraic degree of spectra of Cayley hypergraphs	21
Hamiltonicity of covering graphs of trees	19
On a class of m-to-1 functions	19
Minimum Wiener index of triangulations and quadrangulations	19
The Turán number of the square of a path	18
Algorithmic enumeration of surrounding polygons	18
Editorial Board	18
Some results on vulnerability parameters and Wiener-type indices	17
Independence number and spectral radius of cactus graphs	17
Screw discrete dynamical systems and their applications to exact slow NIM	17
A theoretical investigation on the distinguishers of Salsa and ChaCha	17
A note on generalized semitotal point graphs	16
Sylvester power and weighted sums on the Frobenius set in arithmetic progression	15
Quadratic rotation symmetric Boolean functions	15
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020)	14
Assessing the effect of multiple cost changes using reverse set tolerances	14
Graphr-hued colorings—A survey	14

Avoidable vertices and edges in graphs: Existence, characterization, and applications	13
New constructions of balanced Boolean functions with the maximum possible Walsh supports	13
On b-greedy colourings and z-colourings	12
The weighted Mostar index of cacti	12
Independence number and minimum degree for path-factor critical uniform graphs	11
On some classes of quasi-triangulated graphs	11
Finding k-community structures in special graph classes	10
The gap between the rank of a complex unit gain graph and its underlying graph	10
A note on Seymour’s second neighborhood conjecture	10
A note on the packing chromatic number of lexicographic products	10
Computational complexity of covering disconnected multigraphs	10
On monophonic position sets in graphs	10
Integer k-matchings of graphs: 10
Counting independent sets in tricyclic graphs	10
A note on Hamilton ℓ-cycle decomposition of complete	10
Super graphs on groups, II	10
On the average hitting times ofCay	10
Rainbow domination regular graphs that are not vertex transitive	10
Parameterized complexity for iterated type partitions and modular-width	9
PTASs for secure dominating set in planar graphs and growth-bounded graphs	9
Word-representability of split graphs generated by morphisms	9
Some properties on eccentricity matrices of uniform hypertrees	9
Secure total domination number in maximal outerplanar graphs	9
Some new results concerning power graphs and enhanced power graphs of groups	9
Algorithmic results on locating-total domination in graphs	9
Cubic vertices of minimal bicritical graphs	9
A stability result for Berge-K	9
Distributions of statistics on separable permutations	9
Coloring {P29
Revising Johnson’s table for the 21st century	8
The read once formula of a series–parallel network	8
Generalised outerplanar Turán numbers and maximum number of k-vertex	8
Optimal realizations and the block decomposition of a finite metric space	8
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	8
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	8
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems	8
Uniqueness and reconstruction of finite lattice sets from their line sums	8
Injective chromatic index of sparse graphs	8
On coloring a class of claw-free and hole-twin-free graphs	8
Charging station optimization for balanced electric car sharing	8
Parameterized and exact algorithms for class domination coloring	8
A simplified algorithm computing all s-7
Algorithms for Radon partitions with tolerance	7
On the Δ-interval and the 7
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern	7
On star edge colorings of bipartite and subcubic graphs	7
Editorial Board	7
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams	7
Are all pairs of hypomorphic digraphs S-isomorphic?	7
Axiomatizing the Public Good Index via merging and new arrival properties	7

On leaky forcing and resilience	7
Bounded-degree light approximate shortest-path trees in doubling metrics	7
On a conjecture of Schweser and Stiebitz	7
Gallai–Ramsey numbers for multiple triangles	7
Collision-free routing problem with restricted L-path	7
Hardness results of global total k-domination problem in graphs	7
Four-searchable biconnected outerplanar graphs	7
Minimum values of the second largest Q-eigenvalue	7
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model	7
Parameterized algorithms for the Happy Set problem	7
On extendability of co-edge-regular graphs	7
Rainbow independent sets on dense graph classes	7
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision	7
Exact capacitated domination: On the computational complexity of uniqueness	6
On broadcasting time in the model of travelling agents	6
On zero-sum free sequences contained in random subsets of finite cyclic groups	6
Nordhaus–Gaddum type inequality for the integer k-matching number of a graph	6
Rich words in the block reversal of a word	6
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences	6
On chordal and perfect plane near-triangulations	6
On exponential type sequences	6
Editorial Board	6
A geometric lower bound on the extension complexity of polytopes based on the f	6
A unified construction of weightwise perfectly balanced Boolean functions	6
Non-overlapping descents and ascents in stack-sortable permutations	6
The 5-puzzle doubly covers the soccer ball	6
A note on equitable Hamiltonian cycles	6
The advantage of truncated permutations	6
Emerging applications, models and algorithms in combinatorial optimization	6
Coupled task scheduling with convex resource consumption functions	6
The difference between several metric dimension graph invariants	6
On three blocks paths P(k	6
Metric dimension and metric independence number of incidence graphs of symmetric designs	6
Pushable chromatic number of graphs with maximum average degree at most	6
The sum necessary to ensure that a degree sequence pair has an A-conn	6
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23	6
Factorization and pseudofactorization of weighted graphs	6
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming	6
Competition graphs of degree bounded digraphs	6
On (2,k)<	6
Group distance magic labeling of tetravalent circulant graphs	6
Inexact tree pattern matching with 1-degree edit distance using finite automata	6
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks	6
Graphs with many edge-colorings such that complete graphs are rainbow	6
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles	6
On the tractability of (k,i	6
Exact and approximate results on the least size of a graph with a given degree set	6
The characteristic polynomial of a graph containing loops	6
Counting maximal independent sets in some n-gonal cacti	6
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs	6
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective	6
Disproofs of two conjectures on no hole anti-n-labeling of graphs	6
Are hitting formulas hard for resolution?	6
Local Irregularity Conjecture vs. cacti	6
Eternal dominating sets on digraphs and orientations of graphs	6
Flip paths between lattice triangulations	6
The vertex Turán density in 3-ary n-cubes	5
Minimum 2-dominating sets in regular graphs	5
Non-trivial t-intersecting separated families	5
Fractional matching preclusion number of graphs	5
Super domination: Graph classes, products and enumeration	5
Antimagic labeling of biregular bipartite graphs	5
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme	5
On CD-chromatic number and its lower bound in some classes of graphs	5
Facet-generating procedures for the maximum-impact coloring polytope	5
Diclique digraphs	5
Forbidden triples generating a finite set of graphs with minimum degree three	5
Some further results on the maximal hitting times of trees with some given parameters	5
Anti-Ramsey number of matchings in outerplanar graphs	5
Cycle selections	5
Weighted microscopic image reconstruction	5
Editorial Board	5
A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty	5
On linear layout of bicube and construction of optimal incomplete bicube	5
The general position achievement game played on graphs	5
Positive matching decompositions of graphs	5
Approximation algorithms for some Minimum Postmen Cover Problems	5
A generalization of the independence number	5
Editorial Board	5
The multi-returning secretary problem	5

On the average hitting times of the squares of cycles	5
The co-secure domination in proper interval graphs	5
A characterization of well-indumatchable graphs having girth greater than seven	5
Weighted exchange distance of basis pairs	5
Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree	5
Some results about the inset edge and average distance of trees	5
Listing the bonds of a graph in O<	5
Edge metric dimension and mixed metric dimension of planar graph Q	5
A survey on rainbow (vertex-)index of graphs	5
Antimagic orientation of subdivided caterpillars	5
Going Wide with the 1-2-3 Conjecture	5
Solution to a problem of Katona on counting cliques of weighted graphs	5
Fair integral submodular flows	5
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables	4
On the chromatic number of powers of subdivisions of graphs	4
Stability factor for robust balancing of simple assembly lines under uncertainty	4
Finding densest k-connected subgraphs	4
An improved upper bound for neighbor sum distinguishing edge colorings of graphs	4
Role coloring bipartite graphs	4
Graph curvature via resistance distance	4
On the conjecture of the r-uniform supertrees with the eight largest	4
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class	4
Feedback game on 3-chromatic Eulerian triangulations of surfaces	4
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs	4
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	4
The linear arboricity of K5	4
The oriented chromatic number of the hexagonal grid is 6	4
Security in Sierpiński graphs	4
Characterization of the Jaccard dissimilarity metric and a generalization	4
Editorial Board	4
On nonrepetitive colorings of paths and cycles	4
On the chromatic number of graphs of odd girth without longer odd holes	4
Every 2-connected {claw, Z2	4
Algorithmic aspects of broadcast independence	4
On the generating functions and special functions associated with superoscillations	4
On sufficient spectral radius conditions for hamiltonicity	4
Mixed metric dimension of graphs with edge disjoint cycles	4
The digrundy number of digraphs	4
Dichotomizing k-vertex-critical 4
Solution to a conjecture on resistance diameter of lexicographic product of paths	4
Sum index and difference index of graphs	4
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem	4
Finding kings in tournaments	4
Exploring symmetries in cographs: Obtaining spectra and energies	4
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	4
Factors, spectral radius and toughness in bipartite graphs	4
Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs	4
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs	4
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs	4
Flow resistance to resistance ratios in cubic graphs	4
A note on the minimum inverse sum indeg index of cacti	4
Editorial Board	4
Characterization of component diagnosability of regular networks	4
Rainbow independent sets in graphs with maximum degree two	4
Editorial Board	4
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation	4
A note on the minimum size of matching-saturated graphs	4
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class	4
A short note on the sum of k largest distance eigenvalues of bipartit	4
Enumerating connected induced subgraphs: Improved delay and experimental comparison	4
Relating dissociation, independence, and matchings	4
Exact algorithms for counting 3-colorings of graphs	4
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks	4
Locally definable vertex set properties are efficiently enumerable	4
The minimum ABC index of chemical trees	4
Some local–global phenomena in locally finite graphs	4
On the foundations and extremal structure of the holographic entropy cone	4
Covering automorphisms and some eigenvalues of a graph	4
On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph	4
Vertex-disjoint stars in K1	3
Upper bounds for stabbing simplices by a line	3
Characterizations of graph classes via convex geometries: A survey	3
Rainbow short linear forests in edge-colored complete graph	3
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats	3
Extensions of results on phylogeny graphs of degree bounded digraphs	3
Exploring the rigidity of planar configurations of points and rods	3
Re-1-embeddings of optimal 1-embedded graphs on the projective plane	3
Feedback edge sets in temporal graphs	3
Detecting and enumerating small induced subgraphs in c-closed graph	3
Minimum maximal acyclic matching in proper interval graphs	3
Unraveling the enigmatic irregular coloring of Honeycomb Networks	3
Reliability assessment for modified bubble-sort networks	3
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences	3
Fair multi-cake cutting	3
Assistance and interdiction problems on interval graphs	3
Study on geometric–arithmetic, arithmetic–geometric and Randić indices of graphs	3
Sequence saturation	3
On vertices of outdegree k in minimally 3
A note on the metric and edge metric dimensions of 2-connected graphs	3
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size	3
On large regular (1,1	3
On the cryptographic properties of weightwise affine and weightwise quadratic functions	3
Comparing Wiener complexity with eccentric complexity	3
WITHDRAWN: On the unit interval number of certain graphs	3
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs	3