Transversals and domination in uniform hypergraphs
From MaRDI portal
Publication:649007
DOI10.1016/J.EJC.2011.08.002zbMATH Open1284.05224OpenAlexW1994669980WikidataQ59072587 ScholiaQ59072587MaRDI QIDQ649007FDOQ649007
Authors: Csilla Bujtás, Michael A. Henning, Zsolt Tuza 
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.08.002
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Transversal numbers of uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Domination in hypergraphs
- Title not available (Why is that?)
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Complete description of forbidden subgraphs in the structural domination problem
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- Title not available (Why is that?)
Cited In (52)
- Transversals and independence in linear hypergraphs with maximum degree two
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- A classification of cactus graphs according to their domination number
- Transversals in regular uniform hypergraphs
- A characterization of hypergraphs with large domination number
- Hypergraphs with large domination number and with edge sizes at least three
- Upper transversals in hypergraphs
- The disjoint domination game
- Total domination of graphs and small transversals of hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- The minimum number of vertices in uniform hypergraphs with given domination number
- On upper transversals in 3-uniform hypergraphs
- 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
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- A note on fractional disjoint transversals in hypergraphs
- The Tuza–Vestergaard Theorem
- Transversals in 6-uniform hypergraphs and total domination in graphs with minimum degree six
- Strong transversals in hypergraphs and double total domination in graphs
- Matching and domination numbers in \(r\)-uniform hypergraphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- Title not available (Why is that?)
- A new lower bound on the domination number of a graph
- Domination and total domination in hypergraphs
- Bounds on the game transversal number in hypergraphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Relations among some parameters of hypergraphs
- Bounds on domination parameters in graphs: a brief survey
- Transversals in uniform hypergraphs with property \((p,2)\)
- An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs
- The spectral radius and domination number in linear uniform hypergraphs
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
- Domination and matching in power and generalized power hypergraphs
- Equality of domination and transversal numbers in hypergraphs
- Domination game on uniform hypergraphs
- Total transversals in hypergraphs and their applications
- Transversals in 4-uniform hypergraphs
- Infection in hypergraphs
- Essential upper bounds on the total domination number
- A note on the domination number of triangulations
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Bounds on upper transversals in hypergraphs
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
- Dominating sets for uniform subset graphs
- Partial domination of hypergraphs
- Transversal coalitions in hypergraphs
- Application of superhypergraphs-based domination number in real world
- A new look at the concept of domination in hypergraphs
This page was built for publication: Transversals and domination in uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649007)
