Michal Zakrzewski

collaborators

2 papers

math.CO2025

Unique paired vs edge-vertex minimum dominating sets in trees

Mateusz Miotk, MichaÅ Zakrzewski, PaweÅ Å»yliÅski

We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.

cs.DS2024

Low-degree spanning trees of $2$ -edge-connected graphs in linear time

Dariusz Dereniowski, Janusz DybizbaÅski, PrzemysÅaw KarpiÅski +2

We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$ -edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{Â…

Unique paired vs edge-vertex minimum dominating sets in trees

Low-degree spanning trees of 2-edge-connected graphs in linear time

Low-degree spanning trees of $2$ -edge-connected graphs in linear time