1 citations · 3 across the 8 of their papers we have counts for
10 papers
On the Graceful Game
Luisa Frickes, Simone Dantas, Atílio G. Luiz
A graceful labeling of a graph with edges consists of labeling the vertices of with distinct integers from to such that, when each edge is assigned as induced l…
On the maximum number of minimum dominating sets in forests
J. D. Alvarado, S. Dantas, E. Mohr +1
Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number has at most minimum dominating sets. Bien gave a counterexample, which allows t…
Sandwiches Missing Two Ingredients of Order Four
José D. Alvarado, Simone Dantas, Dieter Rautenbach
For a set of graphs, an instance of the -{\sc free Sandwich Problem} is a pair consisting of two graphs and with the same vertex set su…
Fast and Simple Jumbled Indexing for Binary RLE Strings
Luís Cunha, Simone Dantas, Travis Gagie +3
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size woul…
Relating -Rainbow Domination to Roman domination
José D. Alvarado, Simone Dantas, Dieter Rautenbach
For a graph , let and denote the Roman domination number of and the -rainbow domination number of , respectively. It is known that $γ_{r2}(G)\leq…
Dominating Sets inducing Large Components in Maximal Outerplanar Graphs
José D. Alvarado, Simone Dantas, Dieter Rautenbach
For a maximal outerplanar graph of order at least , Matheson and Tarjan showed that has domination number at most . Similarly, for a maximal outerplanar graph $…