On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481787
Contributor : Ignasi Sau <>
Submitted on : Thursday, March 2, 2017 - 10:01:20 PM
Last modification on : Friday, December 14, 2018 - 11:34:01 AM

Links full text

Identifiers

Collections

Citation

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, et al.. On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩. ⟨lirmm-01481787⟩

Share

Metrics

Record views

121