 | 2012 |
|---|
| 13 |       | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach:
Independent sets and matchings in subcubic graphs.
Discrete Mathematics 312(11): 1900-1910 (2012) |
| 12 | | Christian Löwenstein,
Dieter Rautenbach:
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.
Graphs and Combinatorics 28(3): 407-421 (2012) |
| 2011 |
|---|
| 11 | | Christian Löwenstein,
Dieter Rautenbach,
Friedrich Regen:
On Hamiltonian paths in distance graphs.
Appl. Math. Lett. 24(7): 1075-1079 (2011) |
| 10 | | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach:
Dominating sets, packings, and the maximum degree.
Discrete Mathematics 311(18-19): 2031-2036 (2011) |
| 9 | | Christian Löwenstein,
Anders Sune Pedersen,
Dieter Rautenbach,
Friedrich Regen:
Independence, odd girth, and average degree.
Journal of Graph Theory 67(2): 96-111 (2011) |
| 2010 |
|---|
| 8 | | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach:
An independent dominating set in the complement of a minimum dominating set of a tree.
Appl. Math. Lett. 23(1): 79-81 (2010) |
| 7 | | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach,
Justin Southey:
Disjoint dominating and total dominating sets in graphs.
Discrete Applied Mathematics 158(15): 1615-1623 (2010) |
| 6 | | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach:
Partitioning a graph into a dominating set, a total dominating set, and something else.
Discussiones Mathematicae Graph Theory 30(4): 563-574 (2010) |
| 5 | | Christian Löwenstein,
Dieter Rautenbach:
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.
Graphs and Combinatorics 26(3): 407-424 (2010) |
| 4 | | Christian Löwenstein,
Dieter Rautenbach,
Ingo Schiermeyer:
Cycle length parities and the chromatic number.
Journal of Graph Theory 64(3): 210-218 (2010) |
| 2009 |
|---|
| 3 | | Christian Löwenstein,
Dieter Rautenbach,
Friedrich Regen:
On spanning tree congestion.
Discrete Mathematics 309(13): 4653-4655 (2009) |
| 2 | | Michael A. Henning,
Christian Löwenstein,
Dieter Rautenbach:
Remarks about disjoint dominating sets.
Discrete Mathematics 309(23-24): 6451-6458 (2009) |
| 2008 |
|---|
| 1 | | Christian Löwenstein,
Dieter Rautenbach:
Domination in Graphs of Minimum Degree at least Two and Large Girth.
Graphs and Combinatorics 24(1): 37-46 (2008) |
Data released under the ODC-BY 1.0 license — See also our legal information page