2 papers
math.CO2021
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…
cs.DM2020
Thinness of product graphs
Flavia Bonomo-Braberman, Carolina L. Gonzalez, Fabiano S. Oliveira +2
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be sol…