Efficient domination and efficient edge domination: a brief survey

DOI10.1007/978-3-319-74180-2_1zbMath1400.05170OpenAlexW2782574313MaRDI QIDQ2636549

Andreas Brandstädt

Publication date: 5 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs

This page was built for publication: Efficient domination and efficient edge domination: a brief survey