On the (parameterized) complexity of recognizing well-covered (r,l)-graph (2018)

First Author: Alves S

Attributed to: Detecting Induced Graph Patterns funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.tcs.2018.06.024

Publication URI: http://dx.doi.org/10.1016/j.tcs.2018.06.024

Type: Journal Article/Review

Parent Publication: Theoretical Computer Science