Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs

DOI10.1016/j.tcs.2024.114403arXiv2307.15573WikidataQ129744966 ScholiaQ129744966MaRDI QIDQ6201337

Malory Marin, Carl Feghali

Publication date: 20 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.15573

zbMATH Keywords

FPT algorithms\( \mathbf{W}_{\mathbf{k}}\) graphsconp-completness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monadic second-order evaluations on tree-decomposable graphs
• Roots of independence polynomials of well covered graphs
• On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• 1-well-covered graphs revisited
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Clique-Width is NP-Complete
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity results for well‐covered graphs
• On some subclasses of well-covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles

This page was built for publication: Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs