Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mohamad Adballah"'
Autor:
Mohamad Adballah, Eddie Cheng
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching pre
Externí odkaz:
https://doaj.org/article/0453b1449cd04866998dde7c56e7c5a5