scientific article; zbMATH DE number 7561685
From MaRDI portal
Publication:5092403
DOI10.4230/LIPIcs.MFCS.2019.41MaRDI QIDQ5092403
Esther Galby, Bernard Ries, Paloma T. Lima
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1903.01800
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Reducing the domination number of graphs via edge contractions and vertex deletions ⋮ Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction ⋮ Unnamed Item ⋮ Complexity and algorithms for constant diameter augmentation problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- The most vital nodes with respect to independent set and vertex cover
- Dominating sets for split and bipartite graphs
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Critical vertices and edges in \(H\)-free graphs
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- On the tractability of optimization problems on \(H\)-graphs
- Critical edges for the assignment problem: complexity and exact resolution
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
- The point-set embeddability problem for plane graphs
- Contraction Blockers for Graphs with Forbidden Induced Paths
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions
- Minimum vertex blocker clique problem
- Parameterized Algorithms
This page was built for publication:
