12 citations · 16 across the 11 of their papers we have counts for
12 papers
Minimum Number of Bends of Paths of Trees in a Grid Embedding
V. T. F. Luca, F. S. Oliveira, J. L. Szwarcfiter
We are interested in embedding trees T with maximum degree at most four in a rectangular grid, such that the vertices of T correspond to grid points, while edges of T correspond to…
B1-EPG representations using block-cutpoint trees
V. T. F. Luca, F. S. Oliveira, J. L. Szwarcfiter
In this paper, we are interested in the edge intersection graphs of paths of a grid where each path has at most one bend, called B1-EPG graphs and first introduced by Golumbic et a…
FPT and kernelization algorithms for the k-in-a-tree problem
Guilherme C. M. Gomes, Vinicius F. dos Santos, Murilo V. G. da Silva +1
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the fir…
On the Geodetic Hull Number of Complementary Prisms
Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento +1
Let be a finite, simple, and undirected graph and let be a set of vertices of . In the geodetic convexity, a set of vertices of a graph is convex if all vertices…
Perfect Edge Domination: Hard and Solvable Cases
Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1
Let be an undirected graph. An edge of dominates itself and all edges adjacent to it. A subset of edges of is an edge dominating set of , if every edge of the g…
Constant Threshold Intersection Graphs of Orthodox Paths in Trees
Claudson Ferreira Bornstein, José Wilson Coura Pinto, Dieter Rautenbach +1
A graph belongs to the class for integers , , and if there is a pair , where is a tree of maximum degree at most , and ${\cal…