Completion and decomposition of hypergraphs into dominating sets of graphs

DOI10.1016/J.ENDM.2015.06.031MaRDI QIDQ322230zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Combinatorial bounds via measure and conquer
• Fast algorithms for min independent dominating set
• Independent domination in graphs: A survey and recent results
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Neighborhood hypergraphs of bipartite graphs
• On the enumeration of minimal dominating sets and related notions

Cited in

(3)

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

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)