Uniform clutters and dominating sets of graphs

DOI10.1016/j.dam.2018.03.028zbMath1414.05230OpenAlexW2795271819MaRDI QIDQ2420426

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

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cluttersdominating sets of graphsuniform clutters

Mathematics Subject Classification ID

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

Related Items (2)

Approximation and decomposition in lattices of clutters ⋮ Elimination properties for minimal dominating sets of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion and decomposition of hypergraphs into dominating sets of graphs
• Transformation and decomposition of clutters into matroids
• Minimal dominating sets of cardinality two in a graph
• Completion and decomposition of a clutter into representable matroids
• Graph Classes: A Survey
• On the Enumeration of Minimal Dominating Sets and Related Notions
• Neighborhood hypergraphs of bipartite graphs

This page was built for publication: Uniform clutters and dominating sets of graphs