A Note on the Minimum H-Subgraph Edge Deletion

DOI10.1142/S0129054115500227zbMath1321.05263DBLPjournals/ijfcs/GrigorievMU15OpenAlexW2247427276WikidataQ57338942 ScholiaQ57338942MaRDI QIDQ2947962

Natalya Usotskaya, Bert Marchal, Alexander Grigoriev

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500227

zbMATH Keywords

bounded treewidth\(H\)-free graphminimum edge deletion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the complexity of embedding planar graphs to minimize certain distance measures
• Graph minors. III. Planar tree-width
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• A partial k-arboretum of graphs with bounded treewidth
• Diameter and treewidth in minor-closed graph families
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Algorithms for graphs embeddable with few crossings per edge
• Easy problems for tree-decomposable graphs
• Edge-Deletion Problems
• Efficient Planarity Testing
• Approximation algorithms for NP-complete problems on planar graphs
• A Practical Approach to Courcelle's Theorem

This page was built for publication: A Note on the Minimum H-Subgraph Edge Deletion