Disjoint dominating sets with a perfect matching

DOI10.1142/S1793830917500653zbMath1386.05134arXiv1708.09774OpenAlexW2963264506MaRDI QIDQ4595255

William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello

Publication date: 29 November 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09774

zbMATH Keywords

matchingindependence numberdominating setgrid graph

Mathematics Subject Classification ID

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

Related Items (1)

Self-stabilizing algorithm for two disjoint minimal dominating sets

Cites Work

• Remarks about disjoint dominating sets
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• The Domination Number of Grids
• A dynamic domination problem in trees
• Eternal Independent Sets in Graphs
• An Eternal Domination Problem in Grids
• Protecting a graph with mobile guards
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjoint dominating sets with a perfect matching