Feedback Vertex Set on Graphs of Low Cliquewidth
From MaRDI portal
Publication:3651539
DOI10.1007/978-3-642-10217-2_14zbMath1267.05247MaRDI QIDQ3651539
Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan
Publication date: 11 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_14
Related Items
Kernelization for feedback vertex set via elimination distance to a forest, Tree-representation of set families and applications to combinatorial decompositions, Boolean-width of graphs