Connected feedback vertex set on AT-free graphs

DOI10.1007/s00236-024-00469-5MaRDI QIDQ6658085

Joydeep Mukherjee, Tamojit Saha

Publication date: 8 January 2025

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• The price of connectivity for feedback vertex set
• FPT algorithms for connected feedback vertex set
• Feedback vertex set on AT-free graphs
• On the feedback vertex set problem in permutation graphs
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
• Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
• Domination and total domination on asteroidal triple-free graphs
• On line graphs of subcubic triangle-free graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• Asteroidal Triple-Free Graphs
• Graph Theory and Its Applications
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Computing a dominating pair in an asteroidal triple-free graph in linear time
• Connected domination and steiner set on asteroidal triple-free graphs
• Connected Feedback Vertex Set in Planar Graphs
• On cycle transversals and their connected variants in the absence of a small linear forest
• A logic-based algorithmic meta-theorem for mim-width

This page was built for publication: Connected feedback vertex set on AT-free graphs