Essential upper bounds on the total domination number
From MaRDI portal
Publication:1752594
DOI10.1016/j.dam.2018.03.008zbMath1387.05183OpenAlexW2790966113WikidataQ130070624 ScholiaQ130070624MaRDI QIDQ1752594
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.008
Related Items
A new lower bound on the total domination number of a graph ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ A classification of cactus graphs according to their total domination number
Cites Work
- Transversals and domination in uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- A new upper bound on the total domination number of a graph
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- On the Algorithmic Complexity of Total Domination
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
- Total Domination in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
