Radosław Ziemann

activity

20162026

collaborators

4 papers

math.CO2026

Isolation subdivision number of a graph

Magda Dettlaff, Magdalena Lemańska, Merce Mora +2

For a graph $G = (V, E),$ a set $S \subseteq V$ is called an isolating set of $G$ if the set $V - N [S]$ is independent. The minimum cardinality of an isolating set in $G$ is the isolati…

math.CO2023

A new approach to b-coloring of regular graphs

Magda Dettlaff, Hanna Furmańczyk, Iztok Peterin +2

Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a…

math.CO2017

Graphs with equal domination and certified domination numbers

Magda Dettlaff, Magdalena Lemańska, Mateusz Miotk +3

A set $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_{G} - D$ is adjacent to at least one vertex in $D$ . The domination number (upper domination number…

math.CO2016

Certified domination

Magda Dettlaff, Magdalena Lemańska, Jerzy Topp +2

Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \in W$ , there must be an official $v \in D$ that can serve $x$ , and whenever any such $v…