Three remarks on W₂ graphs

DOI10.1016/J.TCS.2024.114403arXiv2307.15573WikidataQ129744966 ScholiaQ129744966MaRDI QIDQ6201337FDOQ6201337

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

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

Cited In (1)

• 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)