Domination and Total Domination in Hypergraphs

DOI10.1007/978-3-030-58892-2_11zbMath1479.05277OpenAlexW3159331260MaRDI QIDQ3384117

Anders Yeo, Michael A. Henning

Publication date: 14 December 2021

Published in: Developments in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_11

zbMATH Keywords

dominating settotal dominating sethypergraph domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of hypergraphs with large domination number
• Total transversals and total domination in uniform hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least four
• Hypergraphs with large domination number and with edge sizes at least three
• Transversals and domination in uniform hypergraphs
• Transversals and matchings in 3-uniform hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• Total domination of graphs and small transversals of hypergraphs
• Domination in hypergraphs: corrigendum
• A survey of selected recent results on total domination in graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Inverse domination in graphs
• Interrelations among the notions of independence, domination and full sets in a hypergraph
• 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
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Transversal numbers of uniform hypergraphs
• The minimum number of vertices in uniform hypergraphs with given domination number
• Matching and domination numbers in \(r\)-uniform hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Linear hypergraphs with large transversal number and maximum degree two
• Equality of domination and transversal numbers in hypergraphs
• Domination in hypergraphs
• Strong Transversals in Hypergraphs and Double Total Domination in Graphs
• Bounds on a generalized domination parameter
• 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
• Total domination in graphs
• Total Domination in Graphs
• Total Transversals in Hypergraphs and Their Applications

This page was built for publication: Domination and Total Domination in Hypergraphs