The following pages link to Total Domination in Graphs (Q4912481):
Displaying 50 items.
- Disjunctive total domination in graphs (Q266033) (← links)
- Total dominating sequences in graphs (Q267175) (← links)
- Global defensive sets in graphs (Q279197) (← links)
- Game total domination for cycles and paths (Q284829) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Matchings, path covers and domination (Q329554) (← links)
- Trees with large \(m\)-eternal domination number (Q335333) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Total version of the domination game (Q497340) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- (Total) domination in prisms (Q510330) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Domination game: extremal families for the 3/5-conjecture for forests (Q521754) (← links)
- Some comments on the Slater number (Q526227) (← links)
- Transversals in 4-uniform hypergraphs (Q727047) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Domination and dominator colorings in planar graphs with small diameter (Q833001) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Independence in 5-uniform hypergraphs (Q898167) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Vertices contained in all or in no minimum semitotal dominating set of a tree (Q907832) (← links)
- Bounds on the disjunctive total domination number of a tree (Q907839) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- On total domination in the Cartesian product of graphs (Q1656910) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Cubic graphs with total domatic number at least two (Q1692630) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- On the total \(k\)-domination in graphs (Q1692651) (← links)
- Total domination stability in graphs (Q1693151) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- Graphs with few total dominating sets (Q1699541) (← links)
- The matcher game played in graphs (Q1701097) (← links)
