A characterization of hypergraphs with large domination number

DOI10.7151/dmgt.1865zbMath1334.05102OpenAlexW2312570321MaRDI QIDQ274700

Michael A. Henning, Christian Löwenstein

Publication date: 25 April 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1865

zbMATH Keywords

hypergraphtransversaldomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Domination game on uniform hypergraphs ⋮ Domination and Total Domination in Hypergraphs

Cites Work

• Unnamed Item
• Hypergraphs with large transversal number and with edge sizes at least four
• Hypergraphs with large domination number and with edge sizes at least three
• A new bound on the domination number of graphs with minimum degree two
• Transversals and domination in uniform hypergraphs
• Small transversals in hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Domination in hypergraphs
• Domination in graphs of minimum degree at least two and large girth
• Weak edge-degree domination in hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Hypergraph domination and strong independence
• Dominating sets in triangulations on surfaces

This page was built for publication: A characterization of hypergraphs with large domination number