Zobrazeno 1 - 2
of 2
pro vyhledávání: '"METIS-225440"'
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::b15b431c796ecc192934f114565cd957
Autor:
Bonsma, P.S.
A graph is called (matching-)immune if it has no edge cut that is also a matching. Farley and Proskurowski proved that for all immune graphs $G=(V,E)$, $|E|\geq \lceil 3(|V|-1)/2\rceil$, and constructed a large class of immune graphs attaining this l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::cd18bcf9e7df674896b09a68f849d1d1
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html
https://research.utwente.nl/en/publications/a-characterization-of-extremal-graphs-without-matchingcuts(7c55cc1b-5fde-427e-9f42-e63b65bec338).html