12 citations · 17 across the 16 of their papers we have counts for
5 papers · 1 filter
Thinness and its variations on some graph families and coloring graphs of bounded thinness
Flavia Bonomo-Braberman, Eric Brandwein, Fabiano S. Oliveira +3
Interval graphs and proper interval graphs are well known graph classes, for which several generalizations have been proposed in the literature. In this work, we study the (proper)…
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…
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…
Forbidden Induced Subgraphs for Bounded -Intersection Number
Claudson F. Bornstein, Jose W. C. Pinto, Dieter Rautenbach +1
A graph has -intersection number at most if it is possible to assign to every vertex of , a subset of some ground set with in such a way that d…