Dorota Osula

activity

20172021

most citedFinding small-width connected path decompositions in polynomial time

4 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2019

On the connected and weakly convex domination numbers

Magda Dettlaff, Magdalena Lemańska, Dorota Osula +1

In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and w…

math.CO2017

Twin domination number of Tournaments

Dorota Osula, Rita Zuazua

Let $D = (V, A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v \in V - S$ , there exists vertices $u_{1}, u_{2} \in S$ such that $(v, u_{1})$ and…