Hypergraphs with large domination number and with edge sizes at least three
From MaRDI portal
Publication:444441
DOI10.1016/J.DAM.2012.03.023zbMATH Open1245.05098OpenAlexW1976294637MaRDI QIDQ444441FDOQ444441
Authors: Michael A. Henning, Christian Löwenstein 
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.023
Recommendations
- A characterization of hypergraphs with large domination number
- Domination and total domination in hypergraphs
- The minimum number of vertices in uniform hypergraphs with given domination number
- Hypergraphs with large transversal number and with edge sizes at least 3
- Transversals and domination in uniform hypergraphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Domination in hypergraphs
- Domination in graphs of minimum degree at least two and large girth
- Title not available (Why is that?)
- 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
- A new bound on the domination number of graphs with minimum degree two
- Transversals and domination in uniform hypergraphs
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Bounds on a generalized domination parameter
- Title not available (Why is that?)
Cited In (18)
- Infectious power domination of hypergraphs
- A characterization of hypergraphs with large domination number
- The minimum number of vertices in uniform hypergraphs with given domination number
- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
- Total Transversals in Hypergraphs and Their Applications
- Total transversals and total domination in uniform hypergraphs
- The spectral radius and domination number in linear uniform hypergraphs
- Domination in hypergraphs
- Domination and matching in power and generalized power hypergraphs
- Domination and Total Domination in Hypergraphs
- Domination game on uniform hypergraphs
- A new look at the concept of domination in hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
This page was built for publication: Hypergraphs with large domination number and with edge sizes at least three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444441)
