Thomas Sasse

most citedLocating-dominating sets in twin-free graphs

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

collaborators

3 papers

math.CO2014★ 42 cited

Locating-dominating sets in twin-free graphs

Florent Foucaud, Michael A. Henning, Christian Löwenstein +1

A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$ ; th…

math.CO2014★ 2 cited

Induced Cycles in Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

The maximum cardinality of an induced $2$ -regular subgraph of a graph $G$ is denoted by $c_{ind} (G)$ . We prove that if $G$ is an $r$ -regular graph of order $n$ , then $c_{\rm in…

math.CO2013

Induced Matchings in Subcubic Graphs

Felix Joos, Dieter Rautenbach, Thomas Sasse

We prove that a cubic graph with $m$ edges has an induced matching with at least $m /9$ edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and Müller (Indu…