Connected feedback vertex set on AT-free graphs
From MaRDI portal
Publication:6658085
DOI10.1007/S00236-024-00469-5MaRDI QIDQ6658085FDOQ6658085
Authors: Joydeep Mukherjee, Tamojit Saha 
Publication date: 8 January 2025
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
Cites Work
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Asteroidal Triple-Free Graphs
- On the feedback vertex set problem in permutation graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Connected feedback vertex set in planar graphs
- FPT algorithms for connected feedback vertex set
- Domination and total domination on asteroidal triple-free graphs
- Independent Sets in Asteroidal Triple-Free Graphs
- The price of connectivity for feedback vertex set
- Connected domination and steiner set on asteroidal triple-free graphs
- Feedback vertex set on AT-free graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- On line graphs of subcubic triangle-free graphs
- On cycle transversals and their connected variants in the absence of a small linear forest
- Title not available (Why is that?)
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Graph theory and its applications
- Title not available (Why is that?)
- A logic-based algorithmic meta-theorem for mim-width
Cited In (1)
This page was built for publication: Connected feedback vertex set on AT-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658085)
