A Transition from Total Domination in Graphs to Transversals in Hypergraphs
From MaRDI portal
Publication:5456571
DOI10.2989/16073600709486210zbMath1140.05315OpenAlexW2057795228MaRDI QIDQ5456571
Anders Yeo, Michael A. Henning
Publication date: 8 April 2008
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073600709486210
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Unnamed Item ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Graphs with diameter 2 and large total domination number ⋮ Remarks on odd colorings of graphs ⋮ On 2-step and hop dominating sets in graphs ⋮ Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs ⋮ Domination, radius, and minimum degree ⋮ A survey of selected recent results on total domination in graphs ⋮ A note on the \(k\)-tuple total domination number of a graph ⋮ Total Domination in Graphs with Diameter 2