scientific article; zbMATH DE number 6257564

zbMath1281.68122MaRDI QIDQ5747400

Marc Demange, Tınaz Ekim

Publication date: 14 February 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2133/0.html

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

zbMATH Keywords

grid graphsedge dominating setmaximum induced matchingminimum maximal matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Minimum maximal matchings in cubic graphs ⋮ Kernelization of edge perfect code and its variants ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context

This page was built for publication: