Total domination and transformation
From MaRDI portal
Publication:287166
DOI10.1016/S0020-0190(97)00115-4zbMATH Open1337.68133OpenAlexW1980250259MaRDI QIDQ287166FDOQ287166
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00115-4
Recommendations
- Total domination in block graphs
- Total domination in interval graphs
- Total domination in interval graphs
- On the Algorithmic Complexity of Total Domination
- [[:Publication:3688433|Title not available (Why is that?)]]
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (12)
- Domination in rose window graphs
- A survey of selected recent results on total domination in graphs
- On total \(f\)-domination: polyhedral and algorithmic results
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- A smooth transition from powerlessness to absolute power
- An efficient algorithm for distance total domination in block graphs
- Critical concepts in domination
- Domination and total domination on asteroidal triple-free graphs
- Domination in distance-hereditary graphs
- Algorithmic Aspects of Disjunctive Total Domination in Graphs
- Leaf sector covers with applications on circle graphs
This page was built for publication: Total domination and transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287166)
