On the outer-connected domination in graphs
From MaRDI portal
Publication:358644
DOI10.1007/S10878-011-9427-XzbMATH Open1275.90111OpenAlexW2081719370MaRDI QIDQ358644FDOQ358644
Authors: Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmood Sheikholeslami
Publication date: 9 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9427-x
Recommendations
Cites Work
Cited In (20)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- Domination and outer connected domination in maximal outerplanar graphs
- Outer-\(k\)-connected component domination in graphs
- Outer-connected domination in 2-connected cubic graphs
- The outer-connected domination number of Sierpiński-like graphs
- The outer-connected domination number of a graph
- On connected cutfree domination in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Outer-weakly convex domination number of graphs
- OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS
- Total outer-connected domination in trees
- Finding outer-connected dominating sets in interval graphs
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Complexity of total outer-connected domination problem in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- The Outer-Paired Domination of Graphs
- Tractable connected domination for restricted bipartite graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication: On the outer-connected domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358644)