On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
Attributed to:
Detecting Induced Graph Patterns
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-48749-6_31
Publication URI: http://dx.doi.org/10.1007/978-3-319-48749-6_31
Type: Book Chapter
Book Title: Combinatorial Optimization and Applications (2016)
Page Reference: 423-437