Michael A. Henning

most citedDirected Domination in Oriented Graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2013

Simultaneous Domination in Graphs

Yair Caro, Michael A. Henning

Let $F_{1}, F_{2}, ..., F_{k}$ be graphs with the same vertex set $V$ . A subset $S \subseteq V$ is a simultaneous dominating set if for every $i$ , $1 \leq i \leq k$ , every vertex of $F_{i}$ …

math.CO2010

A Greedy Partition Lemma for Directed Domination

Yair Caro, Michael A. Henning

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V (D) ∖ S$ has an adjacent vertex $v$ in $S$ with $v$ directe…

math.CO2010★ 1 cited

Directed Domination in Oriented Graphs

Yair Caro, Michael A. Henning

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V (D) ∖ S$ has an adjacent vertex $v$ in $S$ with $v$ directe…