On the \(d\)-claw vertex deletion problem
From MaRDI portal
Publication:2695329
DOI10.1007/978-3-030-89543-3_49OpenAlexW3209666216MaRDI QIDQ2695329
Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng
Publication date: 30 March 2023
Full work available at URL: https://arxiv.org/abs/2203.06766
Related Items (1)
Cites Work
- Unnamed Item
- Improved upper bounds for vertex cover
- The node-deletion problem for hereditary properties is NP-complete
- Computing independent sets in graphs with large girth
- Geometric algorithms and combinatorial optimization
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Vertex deletion problems on chordal graphs
- Linear-time algorithms for eliminating claws in graphs
- Faster parameterized algorithm for cluster vertex deletion
- Parameterized algorithm for 3-path vertex cover
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Minimum Edge Dominating Sets
- Node-Deletion Problems on Bipartite Graphs
- The approximation of maximum subgraph problems
- Vertex Deletion Problems on Chordal Graphs
- Inapproximability of $H$-Transversal/Packing
This page was built for publication: On the \(d\)-claw vertex deletion problem
