On the (parameterized) complexity of recognizing well-covered (r,)-graph
From MaRDI portal
(Redirected from Publication:1784741)
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Recommendations
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- Partitions and well-coveredness: the graph sandwich problem
- Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs
- Complexity results for well‐covered graphs
- The structure of well-covered graphs with no cycles of length 4
Cites work
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3873377 (Why is no real title available?)
- scientific article; zbMATH DE number 4202288 (Why is no real title available?)
- scientific article; zbMATH DE number 5348111 (Why is no real title available?)
- scientific article; zbMATH DE number 3614795 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A generalization of Villarreal's result for unmixed tripartite graphs
- Algorithmic meta-theorems for restrictions of treewidth
- Complexity results for well‐covered graphs
- Fundamentals of parameterized complexity
- Graph minors. X: Obstructions to tree-decomposition
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph-Theoretic Concepts in Computer Science
- Linear time solvable optimization problems on graphs of bounded clique-width
- List Partitions
- List matrix partitions of chordal graphs
- Machine characterizations for parameterized complexity classes beyond para-NP
- Monadic second-order evaluations on tree-decomposable graphs
- New graph classes of bounded clique-width
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- On the clique-width of some perfect graph classes
- Parameterized algorithms
- Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs
- Parametrized complexity theory.
- Partitions of graphs into one or two independent sets and cliques
- Paths, Trees, and Flowers
- Recent developments on graphs of bounded clique-width
- Reducibility among combinatorial problems
- Some covering concepts in graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Unmixed r-partite graphs
- Upper bounds to the clique width of graphs
- Very well covered graphs
- Well-covered claw-free graphs
- Well-covered graphs and extendability
Cited in
(9)- Partitions and well-coveredness: the graph sandwich problem
- On the probe problem for \((r,\ell )\)-well-coveredness
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- Computing well-covered vector spaces of graphs using modular decomposition
- Mind the independence gap
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
- On the complexity of coloring ‐graphs
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- Recognizing well-dominated graphs is coNP-complete
This page was built for publication: On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784741)
