Domination in Graphs of Minimum Degree at least Two and Large Girth. - Christian Löwenstein; Dieter Rautenbach (Graphs Comb., 2008)

Remarks about disjoint dominating sets. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2009)

On spanning tree congestion. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Discret. Math., 2009)

An independent dominating set in the complement of a minimum dominating set of a tree. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Appl. Math. Lett., 2010)

Disjoint dominating and total dominating sets in graphs. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach; Justin Southey (Discret. Appl. Math., 2010)

Partitioning a graph into a dominating set, a total dominating set, and something else. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discuss. Math. Graph Theory, 2010)

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs. - Christian Löwenstein; Dieter Rautenbach (Graphs Comb., 2010)

Cycle length parities and the chromatic number. - Christian Löwenstein; Dieter Rautenbach; Ingo Schiermeyer (J. Graph Theory, 2010)

On Hamiltonian paths in distance graphs. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Appl. Math. Lett., 2011)

Dominating sets, packings, and the maximum degree. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2011)

Independence, odd girth, and average degree. - Christian Löwenstein; Anders Sune Pedersen; Dieter Rautenbach; Friedrich Regen (J. Graph Theory, 2011)

Hypergraphs with large domination number and with edge sizes at least three. - Michael A. Henning; Christian Löwenstein (Discret. Appl. Math., 2012)

Locating-total domination in claw-free cubic graphs. - Michael A. Henning; Christian Löwenstein (Discret. Math., 2012)

Independent sets and matchings in subcubic graphs. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2012)

Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. - Christian Löwenstein; Dieter Rautenbach (Graphs Comb., 2012)

Chiraptophobic Cockroaches evading a Torch Light. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Ars Comb., 2013)

Generalized Power Domination in Regular Graphs. - Paul Dorbec; Michael A. Henning; Christian Löwenstein; Mickaël Montassier; André Raspaud (SIAM J. Discret. Math., 2013)

A New Lower Bound on the Independence Number of a Graph and Applications. - Michael A. Henning; Christian Löwenstein; Justin Southey; Anders Yeo (Electron. J. Comb., 2014)

Domination and total domination in cubic graphs of large girth. - Simone Dantas; Felix Joos; Christian Löwenstein; Deiwison S. Machado; Dieter Rautenbach (Discret. Appl. Math., 2014)

An improved lower bound on the independence number of a graph. - Michael A. Henning; Christian Löwenstein (Discret. Appl. Math., 2014)

Independent domination in subcubic bipartite graphs of girth at least six. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Appl. Math., 2014)

A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem. - Michael A. Henning; Christian Löwenstein (Discret. Math., 2014)

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs. - Christian Löwenstein; Dieter Rautenbach; Roman Soták (Discret. Math. Theor. Comput. Sci., 2014)

Graphs of interval count two with a given partition. - Felix Joos; Christian Löwenstein; Fabiano de S. Oliveira; Dieter Rautenbach; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2014)

Signed Roman domination in graphs. - Hossein Abdollahzadeh Ahangar; Michael A. Henning; Christian Löwenstein; Yancai Zhao; Vladimir Samodivkin (J. Comb. Optim., 2014)

Locating-dominating sets in twin-free graphs. - Florent Foucaud; Michael A. Henning; Christian Löwenstein; Thomas Sasse (Discret. Appl. Math., 2016)

Induced 2-regular subgraphs in k-chordal cubic graphs. - Michael A. Henning; Felix Joos; Christian Löwenstein; Dieter Rautenbach (Discret. Appl. Math., 2016)

Independence in uniform linear triangle-free hypergraphs. - Piotr Borowiecki; Michael Gentner; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2016)

A characterization of hypergraphs with large domination number. - Michael A. Henning; Christian Löwenstein (Discuss. Math. Graph Theory, 2016)

Induced Cycles in Graphs. - Michael A. Henning; Felix Joos; Christian Löwenstein; Thomas Sasse (Graphs Comb., 2016)

The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3. - Michael A. Henning; Christian Löwenstein (J. Graph Theory, 2016)

Domination game: extremal families for 3/5-conjecture for forests. - Michael A. Henning; Christian Löwenstein (Discuss. Math. Graph Theory, 2017)

The Tuza-Vestergaard Theorem. - Michael A. Henning; Christian Löwenstein; Anders Yeo (SIAM J. Discret. Math., 2023)