scientific article
From MaRDI portal
Publication:3089301
zbMath1244.05164MaRDI QIDQ3089301
Rahma Lounes, Mostafa Blidia, Frédéric Maffray, Mustapha Chellali
Publication date: 24 August 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Some rainbow problems in graphs have complexity equivalent to satisfiability problems ⋮ On redundant locating-dominating sets ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ Unique (optimal) solutions: complexity results for identifying and locating-dominating codes ⋮ On trees with unique locating kernels ⋮ Locating-Domination and Identification ⋮ Open-independent, open-locating-dominating sets ⋮ Unique minimum semipaired dominating sets in trees
This page was built for publication:
