The following pages link to (Q3595118):
Displaying 29 items.
- Total domination number of the conjunction of graphs (Q868378) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Total domination in claw-free graphs with minimum degree 2 (Q932591) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Total domination in graphs with given girth (Q1014823) (← links)
- On the domination number of a graph (Q1613476) (← links)
- On the total \(k\)-domination in graphs (Q1692651) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Essential upper bounds on the total domination number (Q1752594) (← links)
- Total domination and the Caccetta-Häggkvist conjecture (Q1926487) (← links)
- On the forcing domination and the forcing total domination numbers of a graph (Q2165253) (← links)
- On the domination number of a graph defined by containment (Q2332798) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- Asymptotic bounds on total domination in regular graphs (Q2659200) (← links)
- Total \(\alpha\)-domination in graphs (Q2839648) (← links)
- (Q2978290) (← links)
- Dominating Set Counting in Graph Classes (Q3087935) (← links)
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles (Q3605160) (← links)
- (Q3620551) (← links)
- (Q4529248) (← links)
- On the sum of the total domination numbers of a digraph and its converse (Q4622851) (← links)
- (Q4934361) (← links)
- Double hop dominating sets in graphs (Q5025128) (← links)
- (Q5043994) (← links)
- On the L-Grundy domination number of a graph (Q5081167) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- On dominated coloring of graphs and some Nordhaus–Gaddum-type relations (Q5742792) (← links)
- (Q6158951) (← links)
