On the (parameterized) complexity of recognizing well-covered (r,l)-graphs (2017)
Attributed to:
Detecting Induced Graph Patterns
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1705.09177
Publication URI: https://arxiv.org/abs/1705.09177
Type: Preprint