On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
type: Item
instance of: scholarly article
title: On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
zbMATH Open document ID: 1400.68078
author: Sancrey Rodrigues Alves
author: Konrad Dabrowski
author: Sulamita Klein
author: Ignasi Sau
author: Uéverton S. Souza
author: Luerbio Faria
published in: Theoretical Computer Science
publication date: 2018-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6944699
zbMATH Keywords: well-covered graph
zbMATH Keywords: \((r, \ell)\)-graph
zbMATH Keywords: coNP-completeness
zbMATH Keywords: FPT-algorithm
zbMATH Keywords: parameterized complexity
zbMATH Keywords: coW[2]-hardness
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.06.024
OpenAlex ID: W2995257617
cites work: On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
cites work: Partitions of graphs into one or two independent sets and cliques
cites work: New graph classes of bounded clique-width
cites work: Q3139761
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q3077955
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Upper bounds to the clique width of graphs
cites work: Parameterized Algorithms
cites work: Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
cites work: Well-covered graphs and extendability
cites work: Fundamentals of parameterized complexity
cites work: Paths, Trees, and Flowers
cites work: Very well covered graphs
cites work: List Partitions
cites work: List matrix partitions of chordal graphs
cites work: Parametrized complexity theory.
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: A generalization of Villarreal's result for unmixed tripartite graphs
cites work: Recent developments on graphs of bounded clique-width
cites work: Reducibility among Combinatorial Problems
cites work: Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
cites work: Algorithmic meta-theorems for restrictions of treewidth
cites work: Q3340896
cites work: Q5710169
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Some covering concepts in graphs
cites work: Q4179024
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Complexity results for well‐covered graphs
cites work: Well-covered claw-free graphs
cites work: Q3351385
cites work: Q3527613
cites work: Unmixed r-partite graphs
DOI: 10.1016/J.TCS.2018.06.024
description: scientific article; zbMATH DE number 6944699