Three remarks on W₂ graphs

DOI10.1016/J.TCS.2024.114403MaRDI QIDQ6201337zbMATH OpenWikidataFDO

Authors Carl Feghali, Malory Marin

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

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• 1-well-covered graphs revisited
• A characterization of the 1-well-covered graphs with no 4-cycles
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Clique-width is NP-complete
• Complexity results for well‐covered graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Graph structure and monadic second-order logic. A language-theoretic approach
• Linear time solvable optimization problems on graphs of bounded clique-width
• Monadic second-order evaluations on tree-decomposable graphs
• On some subclasses of well-covered graphs
• On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
• Roots of independence polynomials of well covered graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Upper bounds to the clique width of graphs
• WELL-COVERED GRAPHS: A SURVEY

Cited in

(3)

• Beyond recognizing well-covered graphs
• Recognizing relating edges in graphs without cycles of length 6
• Recognizing \(\text{W}_2\) graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201337)