A Note on the Minimum H-Subgraph Edge Deletion
From MaRDI portal
(Redirected from Publication:2947962)
Recommendations
- Minimum \(H\)-decompositions of graphs: edge-critical case
- scientific article; zbMATH DE number 4135976
- Parameterized lower bound and NP-completeness of some \(H\)-free edge deletion problems
- Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph
- Minimum \(H\)-decompositions of graphs
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
- EDGE-DELETION GRAPH PROBLEMS WITH FIRST-ORDER EXPRESSIBLE SUBGRAPH PROPERTIES
- On making a distinguished vertex minimum degree by vertex deletion
- The complexity of some edge deletion problems
- Approximation algorithms for minimum chain vertex deletion
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- A Practical Approach to Courcelle's Theorem
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithms for graphs embeddable with few crossings per edge
- Approximation algorithms for NP-complete problems on planar graphs
- Diameter and treewidth in minor-closed graph families
- Easy problems for tree-decomposable graphs
- Edge-Deletion Problems
- Efficient Planarity Testing
- Graph minors. III. Planar tree-width
- On maximal independent sets of vertices in claw-free graphs
- On the complexity of embedding planar graphs to minimize certain distance measures
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
Cited in
(2)
This page was built for publication: A Note on the Minimum H-Subgraph Edge Deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947962)
