Domination and total domination in hypergraphs
From MaRDI portal
Recommendations
Cites work
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- A characterization of hypergraphs with large domination number
- A survey of selected recent results on total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Bounds on a generalized domination parameter
- Covering all cliques of a graph
- Domination in hypergraphs
- Domination in hypergraphs: corrigendum
- Domination in intersecting hypergraphs
- Equality of domination and transversal numbers in hypergraphs
- Extremal hypergraphs for matching number and domination number
- scientific article; zbMATH DE number 5917555 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 5531984 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 861353 (Why is no real title available?)
- scientific article; zbMATH DE number 866670 (Why is no real title available?)
- Hypergraph domination and strong independence
- Hypergraphs with large domination number and with edge sizes at least three
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraphs with large transversal number and with edge sizes at least four
- Interrelations among the notions of independence, domination and full sets in a hypergraph
- Inverse domination in graphs
- Linear hypergraphs with large transversal number and maximum degree two
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Ryser's conjecture for tripartite 3-graphs
- Small transversals in hypergraphs
- Strong transversals in hypergraphs and double total domination in graphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- The minimum number of vertices in uniform hypergraphs with given domination number
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Total domination in graphs
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Total transversals in hypergraphs and their applications
- Transversal numbers of uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
Cited in
(9)- Domination on hyperbolic graphs
- A characterization of hypergraphs with large domination number
- scientific article; zbMATH DE number 5917555 (Why is no real title available?)
- Completion and decomposition of hypergraphs into dominating sets of graphs
- Hypergraphs with large domination number and with edge sizes at least three
- Total domination in graphs
- scientific article; zbMATH DE number 5259760 (Why is no real title available?)
- Total mixed domination in graphs
- A new look at the concept of domination in hypergraphs
This page was built for publication: Domination and total domination in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384117)
