Reducing the chromatic number by vertex or edge deletions
From MaRDI portal
Publication:2413179
DOI10.1016/j.endm.2017.10.042zbMath1383.05117OpenAlexW2734661547MaRDI QIDQ2413179
Bernard Ries, Daniël Paulusma, Christophe Picouleau
Publication date: 9 April 2018
Full work available at URL: http://dro.dur.ac.uk/21968/1/21968.pdf
Related Items (4)
Using edge contractions and vertex deletions to reduce the independence number and the clique number ⋮ Reducing graph parameters by contractions and deletions ⋮ Critical vertices and edges in \(H\)-free graphs ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
Cites Work
- Unnamed Item
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- The most vital nodes with respect to independent set and vertex cover
- Blockers for the stability number and the chromatic number
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Paw-free graphs
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
- Contraction Blockers for Graphs with Forbidden Induced Paths
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions
- Minimum vertex blocker clique problem
This page was built for publication: Reducing the chromatic number by vertex or edge deletions
