![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 170 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Independent sets and matchings in subcubic graphs. Discrete Mathematics 312(11): 1900-1910 (2012) | |
| 152 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Dominating sets, packings, and the maximum degree. Discrete Mathematics 311(18-19): 2031-2036 (2011) | |
| 142 | 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) | |
| 140 | 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) | |
| 133 | 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) | |
| 122 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Remarks about disjoint dominating sets. Discrete Mathematics 309(23-24): 6451-6458 (2009) | |
| 109 | Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer: The independence number in graphs of maximum degree three. Discrete Mathematics 308(23): 5829-5833 (2008) | |
| 103 | Michael A. Henning, Dieter Rautenbach: On the irregularity of bipartite graphs. Discrete Mathematics 307(11-12): 1467-1472 (2007) | |
| 32 | Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach: On domination and annihilation in graphs with claw-free blocks. Discrete Mathematics 231(1-3): 143-151 (2001) |
Selection of 9 from 177 records - Michael A. Henning has 80 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page