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

DOI10.4230/lipics.mfcs.2021.82OpenAlexW3194437378MaRDI QIDQ6113370

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

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)

Related Items (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