Completion and decomposition of hypergraphs into dominating sets of graphs

DOI10.1016/j.endm.2015.06.031zbMath1346.05203OpenAlexW2217158496MaRDI QIDQ322230

José Luis Ruiz, Jaume Martí-Farré, Mercè Mora

Publication date: 14 October 2016

Full work available at URL: http://hdl.handle.net/2117/81940

zbMATH Keywords

hypergraphdominating set

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Uniform clutters and dominating sets of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Fast algorithms for min independent dominating set
• Independent domination in graphs: A survey and recent results
• Combinatorial bounds via measure and conquer
• On the Enumeration of Minimal Dominating Sets and Related Notions
• Neighborhood hypergraphs of bipartite graphs