📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (2016)

First Author: Sancrey Rodrigues Alves

Attributed to: Detecting Induced Graph Patterns funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.60692/vna2a-svz14

Publication URI: https://gresis.osc.int//doi/10.60692/vna2a-svz14

Type: Other