Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs

DOI10.4230/LIPICS.MFCS.2021.82OpenAlexW3194437378MaRDI QIDQ6113370FDOQ6113370

Authors: Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski 

Publication date: 8 August 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2021.82

zbMATH Keywords

blockforestfeedback vertex seteven cycle transversalodd cactus

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (3)

• Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs
• Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
• Partitioning \(H\)-free graphs of bounded diameter

This page was built for publication: Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs

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