scientific article

zbMath1274.05065MaRDI QIDQ2857332

Marie-Christine Costa, Bernard Ries, Dominique de Werra, Cédric Bentz, Christophe Picouleau

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311000916

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)

Related Items (2)

Using edge contractions and vertex deletions to reduce the independence number and the clique number ⋮ Reducing graph parameters by contractions and deletions

Cites Work

• Minimum \(d\)-blockers and \(d\)-transversals in graphs
• Network flow interdiction on planar graphs
• Blockers and transversals
• Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid

This page was built for publication: