Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Masquio, Bruno P."'
Autor:
Gomes, Guilherme C. M., Masquio, Bruno P., Pinto, Paulo E. D., Rautenbach, Dieter, Santos, Vinicius F. dos, Szwarcfiter, Jayme L., Werner, Florian
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 induced matching numbers are defined as the maximum cardinality of suc
Externí odkaz:
http://arxiv.org/abs/2409.04855
Autor:
Gomes, Guilherme C. M., Masquio, Bruno P., Pinto, Paulo E. D., Santos, Vinicius F. dos, Szwarcfiter, Jayme L.
A matching $M$ is a $\mathscr{P}$-matching if the subgraph induced by the endpoints of the edges of $M$ satisfies property $\mathscr{P}$. As examples, for appropriate choices of $\mathscr{P}$, the problems Induced Matching, Uniquely Restricted Matchi
Externí odkaz:
http://arxiv.org/abs/2202.04746
Autor:
Gomes, Guilherme C. M., Masquio, Bruno P., Pinto, Paulo E. D., Santos, Vinicius F. dos, Szwarcfiter, Jayme L.
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational complexity of determining the maximum cardinality of a matching whose vertex
Externí odkaz:
http://arxiv.org/abs/2112.09248
Autor:
Gomes, Guilherme C.M., Masquio, Bruno P., Pinto, Paulo E.D., dos Santos, Vinicius F., Szwarcfiter, Jayme L.
Publikováno v:
In Theoretical Computer Science 4 May 2023 956
Autor:
Zudio, Anderson, da Silva Costa, Daniel Henrique, Masquio, Bruno Porto, Coelho, Igor M., Pinto, Paulo Eustáquio Duarte
Publikováno v:
Electronic Notes in Discrete Mathematics; Apr2018, Vol. 66, p175-182, 8p