research
∙
04/19/2023
On the complexity of Dominating Set for graphs with fixed diameter
A set S⊆ V of a graph G=(V,E) is a dominating set if each vertex has a n...
share
research
∙
07/23/2021
The complexity of the Bondage problem in planar graphs
A set S⊆ V(G) of a graph G is a dominating set if each vertex has a neig...
research
∙
02/27/2020
On Minimum Dominating Sets in cubic and (claw,H)-free graphs
Given a graph G=(V,E), S⊆ V is a dominating set if every v∈ V∖ S is adja...
research
∙
09/06/2019