Blockers for the stability number and the chromatic number
type: Item
instance of: scholarly article
title: Blockers for the stability number and the chromatic number
zbMATH Open document ID: 1306.05051
author: Cédric Bentz
author: Bernard Ries
author: Cristina Bazgan
author: Christophe Picouleau
published in: Graphs and Combinatorics
publication date: 2015-01-20T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6388164
zbMATH Keywords: blocker
zbMATH Keywords: chromatic number
zbMATH Keywords: stability number
zbMATH Keywords: bipartitegraph
zbMATH Keywords: split graph
zbMATH Keywords: threshold graph
MaRDI profile type: Publication
full work available at URL: s00373-013-1380-2
OpenAlex ID: W2044825393
cites work: Q4208001
cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
cites work: The most vital nodes with respect to independent set and vertex cover
cites work: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
cites work: Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
cites work: \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
cites work: Crown reductions for the minimum weighted vertex cover problem
cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs
cites work: The bondage number of a graph
cites work: Q4875228
cites work: Q4198056
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: The path partition problem and related problems in bipartite graphs
cites work: Blockers and transversals
cites work: Deterministic network interdiction
cites work: Matching interdiction
DOI: 10.1007/S00373-013-1380-2
description: scientific article; zbMATH DE number 6388164