Discrete Applied Mathematics

Article	Citations
FPT algorithms for packing k-safe spanning rooted sub(di)graphs	50
Minimum length word-representants of word-representable graphs	44
The degree sequence of the preferential attachment model	42
On the Nash number and the diminishing Grundy number of a graph	37
Coloring of (P6	34
An inductive proof of Dirac’s theorem on Hamilton cycles	24
On the minimum Kirchhoff index of graphs with a given number of cut vertices	24
On the thinness of trees	23
Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem	22
Mutual-visibility in strong products of graphs via total mutual-visibility	22
Planar median graphs and cubesquare-graphs	22
Minimum Wiener index of triangulations and quadrangulations	21
An improved algorithm for finding maximum outerplanar subgraphs	21
On a class of m-to-1 functions	20
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems	19
Rainbow short linear forests in edge-colored complete graph	19
Some results on vulnerability parameters and Wiener-type indices	17
Independence, matching and packing coloring of the iterated Mycielskian of graphs	17
Editorial Board	17
On enumerating short projected models	17
A note on Seymour’s second neighborhood conjecture	16
Independence number and minimum degree for path-factor critical uniform graphs	15
A note on generalized semitotal point graphs	14
Characterization of component diagnosability of regular networks	14
A theoretical investigation on the distinguishers of Salsa and ChaCha	14

Quadratic rotation symmetric Boolean functions	14
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs	14
Assessing the effect of multiple cost changes using reverse set tolerances	13
Finding k-community structures in special graph classes	13
Sylvester power and weighted sums on the Frobenius set in arithmetic progression	13
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020)	13
On the average hitting times ofCay	12
Super graphs on groups, II	12
Counting independent sets in tricyclic graphs	12
The combinatorics of Motzkin polyominoes	11
Algorithmic enumeration of surrounding polygons	11
Word-representability of split graphs generated by morphisms	11
The read once formula of a series–parallel network	11
Coloring {P211
Optimal realizations and the block decomposition of a finite metric space	11
Algorithmic results on locating-total domination in graphs	11
On coloring a class of claw-free and hole-twin-free graphs	10
Minimum values of the second largest Q-eigenvalue	10
Four-searchable biconnected outerplanar graphs	10
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model	10
Distinguishing graphs via cycles	10
On the hardness of problems around s-clubs on split graphs	10
Hardness results of global total k-domination problem in graphs	9
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective	9
Exact capacitated domination: On the computational complexity of uniqueness	9
The difference between several metric dimension graph invariants	9
Collision-free routing problem with restricted L-path	9
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs	9
Emerging applications, models and algorithms in combinatorial optimization	9
On chordal and perfect plane near-triangulations	9
Axiomatizing the Public Good Index via merging and new arrival properties	9
Editorial Board	9
Editorial Board	9
Rich words in the block reversal of a word	9
A unified construction of weightwise perfectly balanced Boolean functions	8
On three blocks paths P(k	8
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences	8
A characterization of well-indumatchable graphs having girth greater than seven	8
Fractional matching preclusion number of graphs	8
Factorization and pseudofactorization of weighted graphs	8
Counting maximal independent sets in some n-gonal cacti	8
Weighted microscopic image reconstruction	8
Cycle selections	8
Non-trivial t-intersecting separated families	8
The 5-puzzle doubly covers the soccer ball	8
Exact and approximate results on the least size of a graph with a given degree set	8
Competition graphs of degree bounded digraphs	8
Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree	8
The co-secure domination in proper interval graphs	8
Security in Sierpiński graphs	7

Facet-generating procedures for the maximum-impact coloring polytope	7
Editorial Board	7
On the average hitting times of the squares of cycles	7
Exploring symmetries in cographs: Obtaining spectra and energies	7
A single representative min–max–min robust selection problem with alternatives and budgeted uncertainty	7
Some local–global phenomena in locally finite graphs	7
Editorial Board	7
Editorial Board	7
Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs	7
Finding kings in tournaments	7
Some results about the inset edge and average distance of trees	7
The multi-returning secretary problem	7
Editorial Board	7
The vertex Turán density in 3-ary n-cubes	7
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding	7
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem	7
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks	7
Graph polynomials and paintability of plane graphs	7
Algorithmic aspects of broadcast independence	7
Exact algorithms for counting 3-colorings of graphs	7
Positive matching decompositions of graphs	7
Antimagic orientation of subdivided caterpillars	7
Some further results on the maximal hitting times of trees with some given parameters	7
Role coloring bipartite graphs	7
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs	7
Relating dissociation, independence, and matchings	7
Stability factor for robust balancing of simple assembly lines under uncertainty	7
Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class	7
Rainbow independent sets in graphs with maximum degree two	7
Covering automorphisms and some eigenvalues of a graph	7
A note on eigenvalue, spectral radius and energy of extended adjacency matrix	6
On the foundations and extremal structure of the holographic entropy cone	6
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs	6
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs	6
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs	6
The digrundy number of digraphs	6
Graph curvature via resistance distance	6
On the chromatic number of powers of subdivisions of graphs	6
Rainbow triangles in arc-colored digraphs	6
Flow resistance to resistance ratios in cubic graphs	6
The change of Seidel energy of 5-partite Turán graph due to edge deletion	6
Solution to a problem of Katona on counting cliques of weighted graphs	6
Selective dynamic compression	6
Neighbor connectivity of pancake graphs and burnt pancake graphs	6
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain	6
On injective edge-coloring of graphs with maximum degree 4	6
Maximum bisections of graphs without cycles of length four and five	6
On the generating functions and special functions associated with superoscillations	6
Characterization of the Jaccard dissimilarity metric and a generalization	6
Factors, spectral radius and toughness in bipartite graphs	6
Equitable factorizations of edge-connected graphs	6
Unicyclic and bicyclic graphs with maximum exponential second Zagreb index	6
Group distance magic labeling of tetravalent circulant graphs	6
Non-overlapping descents and ascents in stack-sortable permutations	6
3-path-connectivity of Cayley graphs generated by transposition trees	6
Pagoda functions for peg solitaire on graphs	6
Matroid optimization problems with monotone monomials in the objective	6
Editorial Board	6
Proper conflict-free coloring of sparse graphs	6
Every 2-connected {claw, Z2	6
Editorial Board	6
Solution to a conjecture on resistance diameter of lexicographic product of paths	6
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set	6
Local Irregularity Conjecture vs. cacti	6
On (2,k)<	6
On the chromatic number of graphs of odd girth without longer odd holes	6
Flip paths between lattice triangulations	6
On nonrepetitive colorings of paths and cycles	6
Nordhaus–Gaddum type inequality for the integer k-matching number of a graph	6
Cubic vertices of minimal bicritical graphs	5
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme	5
Injective chromatic index of sparse graphs	5
New constructions of balanced Boolean functions with the maximum possible Walsh supports	5
Super domination: Graph classes, products and enumeration	5
Charging station optimization for balanced electric car sharing	5
Enumerating connected induced subgraphs: Improved delay and experimental comparison	5
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]	5
On the rainbow planar Turán number of double stars	5
Some properties on eccentricity matrices of uniform hypertrees	5
The oriented chromatic number of the hexagonal grid is 6	5

Weighted exchange distance of basis pairs	5
A note on the minimum size of matching-saturated graphs	5
Feedback game on 3-chromatic Eulerian triangulations of surfaces	5
Anti-Ramsey number of matchings in outerplanar graphs	5
Rainbow domination regular graphs that are not vertex transitive	5
On CD-chromatic number and its lower bound in some classes of graphs	5
On sufficient spectral radius conditions for hamiltonicity	5
A note on Hamilton ℓ-cycle decomposition of complete	5
Distributions of statistics on separable permutations	5
A stability result for Berge-K	5
Uniqueness and reconstruction of finite lattice sets from their line sums	5
Improving the Caro–Wei bound and applications to Turán stability	5
Secure total domination number in maximal outerplanar graphs	5
The Turán number of the square of a path	5
Coupled task scheduling with convex resource consumption functions	5
Diclique digraphs	5
Parameterized complexity for iterated type partitions and modular-width	5
Listing the bonds of a graph in O<	5
Independence number and spectral radius of cactus graphs	5
PTASs for secure dominating set in planar graphs and growth-bounded graphs	5
On the total version of the covering Italian domination problem	5
An improved upper bound for neighbor sum distinguishing edge colorings of graphs	5
Some new results concerning power graphs and enhanced power graphs of groups	5
A survey on rainbow (vertex-)index of graphs	5
Finding densest k-connected subgraphs	4
Computational complexity of covering disconnected multigraphs	4
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions	4
Approximation algorithms for some Minimum Postmen Cover Problems	4
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property	4
Gallai–Ramsey numbers for multiple triangles	4
Inexact tree pattern matching with 1-degree edit distance using finite automata	4
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks	4
On the semi-proper orientations of graphs	4
Algorithms for Radon partitions with tolerance	4
Minimum 2-dominating sets in regular graphs	4
New results on edge-coloring and total-coloring of split graphs	4
Screw discrete dynamical systems and their applications to exact slow NIM	4
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision	4
On (exponential) bond incident degree indices of graphs	4
Bounded-degree light approximate shortest-path trees in doubling metrics	4
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming	4
Avoidable vertices and edges in graphs: Existence, characterization, and applications	4
On zero-sum free sequences contained in random subsets of finite cyclic groups	4
Mixed metric dimension of graphs with edge disjoint cycles	4
On the conjecture of the r-uniform supertrees with the eight largest	4
Multi-objective matroid optimization with ordinal weights	4
On a conjecture of Schweser and Stiebitz	4
Antimagic labeling of biregular bipartite graphs	4
A note on the packing chromatic number of lexicographic products	4
Locally definable vertex set properties are efficiently enumerable	4
Integer k-matchings of graphs: 4
Are all pairs of hypomorphic digraphs S-isomorphic?	4
On b-greedy colourings and z-colourings	4
Parameterized algorithms for the Happy Set problem	4
The weighted Mostar index of cacti	4
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams	4
Pushable chromatic number of graphs with maximum average degree at most	4
A simplified algorithm computing all s-4
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs	4
The characteristic polynomial of a graph containing loops	4
Graphs with many edge-colorings such that complete graphs are rainbow	4
Tight isolated toughness bound for fractional (k	4
Note on the eccentricity spectral radius of uniform hypertrees with given diameter	4
Sum index and difference index of graphs	4
The advantage of truncated permutations	4
House of Graphs 2.0: A database of interesting graphs and more	4
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs	4
The gap between the rank of a complex unit gain graph and its underlying graph	4
Generalised outerplanar Turán numbers and maximum number of k-vertex	4
Dichotomizing k-vertex-critical 4
Hamiltonicity of covering graphs of trees	4
Disproofs of two conjectures on no hole anti-n-labeling of graphs	4
Are hitting formulas hard for resolution?	4
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs	4
On exponential type sequences	4
WITHDRAWN: On the unit interval number of certain graphs	3
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph	3
Editorial Board	3
Graphs with small Italian domatic number	3
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions	3
Online 2-stage stable matching	3
Investigations on c-boomerang uniformity and perfect nonlinearity	3
A note on the metric and edge metric dimensions of 2-connected graphs	3
Recursive MDS matrices over finite commutative rings	3
Upper bounds for stabbing simplices by a line	3
Editorial Board	3
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs	3
Short k-rotation symmetric Boolean functions	3
New comments on “A Hamilton sufficient condition for completely independent spanning tree”	3
Unraveling the enigmatic irregular coloring of Honeycomb Networks	3
Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)	3
Erdös–Gallai-type problems for distance-edge-monitoring numbers	3
On the information ratio of graphs without high-degree neighbors	3
Preface: LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil	3
Hardness results of global roman domination in graphs	3