On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (2016)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.60692/f5k75-d4b64
Publication URI: https://gresis.osc.int//doi/10.60692/f5k75-d4b64
Type: Other