Complexity of total outer-connected domination problem in graphs
type: Item
instance of: scholarly article
title: Complexity of total outer-connected domination problem in graphs
zbMATH Open document ID: 1326.05110
author: B. S. Panda
author: Arti Pandey
published in: Discrete Applied Mathematics
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6519407
zbMATH Keywords: domination
zbMATH Keywords: total outer-connected domination
zbMATH Keywords: graph algorithms
zbMATH Keywords: chordal graph
zbMATH Keywords: NP-complete
zbMATH Keywords: APX-complete
MaRDI profile type: Publication
full work available at URL: j.dam.2015.05.009
OpenAlex ID: W904840816
cites work: On the outer-connected domination in graphs
cites work: Some APX-completeness results for cubic graphs
cites work: Dually Chordal Graphs
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q5442365
cites work: Total outer-connected domination in trees
cites work: Total outer-connected domination numbers of trees
cites work: Q3577833
cites work: On the total outer-connected domination in graphs
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: A note on the total outer-connected domination number of a tree
cites work: Q4368729
cites work: Q4368728
cites work: A survey of selected recent results on total domination in graphs
cites work: Total Domination in Graphs
cites work: Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
cites work: Q3059038
cites work: Computing a minimum outer-connected dominating set for the class of chordal graphs
cites work: Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
cites work: Optimization, approximation, and complexity classes
cites work: Algorithmic aspects of \(k\)-tuple total domination in graphs
cites work: On the complexity of the minimum outer-connected dominating set problem in graphs
DOI: 10.1016/J.DAM.2015.05.009
description: scientific article; zbMATH DE number 6519407