scientific article; zbMATH DE number 7378380
From MaRDI portal
Publication:5005166
DOI10.4230/LIPIcs.MFCS.2018.63MaRDI QIDQ5005166
Matthew Johnson, Daniël Paulusma, Giacomo Paesani, Konrad K. Dabrowski, Victor Zamaraev
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1910.05254
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ On the price of independence for vertex cover, feedback vertex set and odd cycle transversal ⋮ Computing subset transversals in \(H\)-free graphs
Cites Work
- The price of connectivity for dominating set: upper bounds and complexity
- The price of connectivity for feedback vertex set
- A note on an induced subgraph characterization of domination perfect graphs
- The price of connectivity for cycle transversals
- Connected vertex covers in dense graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Recognizing Graphs Close to Bipartite Graphs
- Independent Feedback Vertex Set for P_5-free Graphs
- The Price of Connectivity for Vertex Cover
- Connected Feedback Vertex Set in Planar Graphs
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
This page was built for publication:
