15 citations · 28 across the 14 of their papers we have counts for
8 papers · 1 filter
The complexity of minimum-density locating-dominating set in infinite periodic graphs
Arthur C. Gomes, Yoshiko Wakabayashi
A dominating set of a graph is a locating-dominating set (LDS) if, for each pair of distinct vertices not in~, their neighbourhoods in are distinct. Finding a minimu…
Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows
Arthur C. Gomes, Yoshiko Wakabayashi
A set of vertices of a graph is locating-dominating if is dominating and, for each pair of distinct vertices not in , their neighborhoods in are distinct. We pre…
On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture
F. Botler, A. Jiménez, M. Sambinelli +1
The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph with vertices of degree 2 an…
Boundedness for proper conflict-free and odd colorings
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7
The proper conflict-free chromatic number, , of a graph is the least such that has a proper -coloring in which for each non-isolated vertex there is a co…
A tight lower bound for the online bounded space hypercube bin packing problem
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
In the -dimensional hypercube bin packing problem, a given list of -dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SI…
Decomposing highly edge-connected graphs into paths of any given length
Fabio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1
In 2006, Barát and Thomassen posed the following conjecture: for each tree , there exists a natural number such that, if is a -edge-connected graph and i…
Decompositions of highly connected graphs into paths of length five
Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1
We study the Decomposition Conjecture posed by Barát and Thomassen (2006), which states that for every tree there exists a natural number such that, if is a -edg…
On path-cycle decompositions of triangle-free graphs
Andrea Jiménez, Yoshiko Wakabayashi
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given…