12 citations · 16 across the 12 of their papers we have counts for
7 papers · 1 filter
Complexity of Deciding the Equality of Matching Numbers
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +4
A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and…
Edge Intersection Graphs of Paths on a Triangular Grid
Vitor T. F. de Luca, María Pía Mazzoleni, Fabiano S. Oliveira +2
We introduce a new class of intersection graphs, the edge intersection graphs of paths on a triangular grid, called EPGt graphs. We show similarities and differences from this new…
Weighted Connected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
A matching is a -matching if the subgraph induced by the endpoints of the edges of satisfies property . As examples, for appropriate choices of $\…
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…
Efficient and Perfect domination on circular-arc graphs
Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
Given a graph , a \emph{perfect dominating set} is a subset of vertices such that each vertex is dominated by exactly one ve…