Christian Löwenstein

most citedLocating-dominating sets in twin-free graphs

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

collaborators

4 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

Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

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

We show that a cubic graph $G$ of order $n$ has an induced $2$ -regular subgraph of order at least a) $\frac{n - 2}{4 - \frac{4}{k}}$ , if $G$ has no induced cycle of length more than $k…

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.CO2014

A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem

Michael A. Henning, Christian Löwenstein

For $k \geq 2$ , let $H$ be a $k$ -uniform hypergraph on $n$ vertices and $m$ edges. The transversal number $τ (H)$ of $H$ is the minimum number of vertices that intersect every edge.…