1 citations · 1 across the 3 of their papers we have counts for
3 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…
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 $\…
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…