Transversals and domination in uniform hypergraphs
From MaRDI portal
Publication:649007
DOI10.1016/j.ejc.2011.08.002zbMath1284.05224OpenAlexW1994669980WikidataQ59072587 ScholiaQ59072587MaRDI QIDQ649007
Zsolt Tuza, Csilla Bujtás, Michael A. Henning
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
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (38)
A characterization of hypergraphs with large domination number ⋮ Transversals and independence in linear hypergraphs with maximum degree two ⋮ The disjoint domination game ⋮ On upper transversals in 3-uniform hypergraphs ⋮ Domination in intersecting hypergraphs ⋮ Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Bounds on the game transversal number in hypergraphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Matching and domination numbers in \(r\)-uniform hypergraphs ⋮ Minimum size transversals in uniform hypergraphs ⋮ Total transversals and total domination in uniform hypergraphs ⋮ Upper transversals in hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ Infection in hypergraphs ⋮ Hypergraphs with large domination number and with edge sizes at least three ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ Unnamed Item ⋮ Domination game on uniform hypergraphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Essential upper bounds on the total domination number ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number ⋮ Transversals in 4-uniform hypergraphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ The spectral radius and domination number in linear uniform hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ A new lower bound on the domination number of a graph ⋮ A Note on the Domination Number of Triangulations ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ A classification of cactus graphs according to their domination number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Covering all cliques of a graph
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Domination in hypergraphs
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- 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
- Hypergraph domination and strong independence
This page was built for publication: Transversals and domination in uniform hypergraphs