Complexity of total outer-connected domination problem in graphs
From MaRDI portal
Publication:896660
DOI10.1016/J.DAM.2015.05.009zbMath1326.05110OpenAlexW904840816MaRDI QIDQ896660
Publication date: 10 December 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.009
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the outer-connected domination in graphs
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- A note on the total outer-connected domination number of a tree
- Approximation hardness of dominating set problems in bounded degree graphs
- Total outer-connected domination numbers of trees
- A survey of selected recent results on total domination in graphs
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- On the total outer-connected domination in graphs
- Incidence matrices and interval graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Total outer-connected domination in trees
- Dually Chordal Graphs
- Total Domination in Graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
This page was built for publication: Complexity of total outer-connected domination problem in graphs
