Pages that link to "Item:Q3696538"
From MaRDI portal
The following pages link to On the Algorithmic Complexity of Total Domination (Q3696538):
Displaying 50 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- On the independence transversal total domination number of graphs (Q505424) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- On the computational complexity of upper total domination (Q1421481) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- Essential upper bounds on the total domination number (Q1752594) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Total 2-domination of proper interval graphs (Q2043384) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
- Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
- Dominated colorings of graphs (Q2345536) (← links)
- Paired domination on interval and circular-arc graphs (Q2384392) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- (Q3341896) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- (Q4941163) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)