37 citations · 115 across the 24 of their papers we have counts for
3 papers · 1 filter
Disconnected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational comple…
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…