Completion and decomposition of hypergraphs into dominating sets of graphs

DOI10.1016/J.ENDM.2015.06.031zbMATH Open1346.05203OpenAlexW2217158496MaRDI QIDQ322230FDOQ322230

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

Publication date: 14 October 2016

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

Recommendations

• Domination in hypergraphs
• Domination hypergraphs of certain digraphs
• Hypergraphs with large domination number and with edge sizes at least three
• Domination and total domination in hypergraphs
• scientific article; zbMATH DE number 7655476

zbMATH Keywords

dominating sethypergraph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Independent domination in graphs: A survey and recent results
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Combinatorial bounds via measure and conquer
• On the enumeration of minimal dominating sets and related notions
• Fast algorithms for min independent dominating set
• Neighborhood hypergraphs of bipartite graphs

Cited In (3)

• Uniform clutters and dominating sets of graphs
• Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
• Decomposition of the complete hypergraph into delta-systems. I

This page was built for publication: Completion and decomposition of hypergraphs into dominating sets of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322230)