Efficient sets in graphs
type: Item
instance of: scholarly article
title: Efficient sets in graphs
zbMATH Open document ID: 0780.68097
DOI: 10.1016/0166-218X(93)90225-D
author: Juan-Miguel Gracia
published in: Discrete Applied Mathematics
publication date: 1994-01-31T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 428106
zbMATH Keywords: efficiency of a graph
zbMATH Keywords: independent efficient dominating set
MaRDI profile type: MaRDI publication profile
cites work: Q3815323
cites work: Linear-time computation of optimal subgraphs of decomposable graphs
cites work: Q4894998
cites work: Planar 3DM is NP-complete
cites work: Q3337494
cites work: Q3328474
cites work: Q4198056
cites work: A recurrence template for several parameters in series-parallel graphs
cites work: Q3822197
Recommended article: Efficient sets in partial \(k\)-trees
Recommended article: Q4304361
Recommended article: Q3815323
Recommended article: Q3413877
Recommended article: The efficiency of AC graphs
description: scientific article; zbMATH DE number 428106