Desktop-Bild

Publikationen

Publikationen 2009
On the existence of edge cuts leaving several large components  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 309 (2009), no. 6, 1703--1707.
 
Publikationen 2008
alpha-domination perfect trees  
Franz Dahme, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 308 (2008), no. 15, 3187--3198.
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles  
Dieter Rautenbach, Lutz Volkmann
Networks 52 (2008), no. 4, 252--255.
Some remarks on lambda(p,q)-connectedness  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 308 (2008), no. 23, 5562--5569.
 
Publikationen 2007
New bounds on the k-domination number and the k-tuple domination number  
Dieter Rautenbach, Lutz Volkmann
Appl. Math. Lett. 20 (2007), no. 1, 98--102.
 
Publikationen 2005
Extremal trees with respect to dominance order  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
Ars Combin. 76 (2005), 249--255.
A note on the number of matchings and independent sets in trees  
Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach
Discrete Appl. Math. 145 (2005), no. 3, 483--489.
Cuts leaving components of given minimum order  
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 292 (2005), no. 1-3, 55--65.
 
Publikationen 2004
Some remarks on alpha-domination  
Franz Dahme, Dieter Rautenbach, Lutz Volkmann
Discuss. Math. Graph Theory 24 (2004), no. 3, 423--430.
Erster Aachener Tag der Graphentheorie  
Miranca Fischermann, Yubao Guo, Angelika Hellwig, Arne Hoffmann, Dirk Meierling, Bert Randerath, Dieter Rautenbach, Meike Tewes, Stefan Winzen
, Rheinisch-Westfälische Technische Hochschule Aachen (2004).
Cutting a graph into small components  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
J. Combin. Math. Combin. Comput. 48 (2004), 217--222.
A note on the connectivity of line graphs  
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
Inform. Process. Lett. 91 (2004), no. 1, 7--10.
 
Publikationen 2003
Weighted domination  
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
J. Combin. Math. Combin. Comput. 45 (2003), 195--207.
A linear-programming approach to the generalized Randic index  
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann
Discrete Appl. Math. 128 (2003), no. 2-3, 375--385.
A note on the complexity of graph parameters and the uniqueness of their realizations  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
J. Combin. Math. Combin. Comput. 47 (2003), 183--188.
Maximum graphs with a unique minimum dominating set  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 260 (2003), no. 1-3, 197--203.
Remarks on the bondage number of planar graphs  
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 260 (2003), no. 1-3, 57--67.
A note on the reconstruction of sets of finite measure  
Dieter Rautenbach, Eberhard Triesch
Acta Math. Hungar. 100 (2003), no. 1-2, 31--36.
Extremal subgraphs with respect to vertex degree bounds  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 263 (2003), no. 1-3, 297--303.
On (alpha_r)(gamma_s)(k)-perfect graphs  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 270 (2003), no. 1-3, 241--250.
 
Publikationen 2002
Weighted domination in triangle-free graphs  
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 250 (2002), no. 1-3, 233--239.
Extremal chemical trees  
Miranca Fischermann, I. Gutman, Arne Hoffmann, Dieter Rautenbach, D. Vidovic, Lutz Volkmann
Z. Naturforsch. 57 a (2002), 49-52.
Wiener index versus maximum degree in trees  
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Laszlo Szekely, Lutz Volkmann
Discrete Appl. Math. 122 (2002), no. 1-3, 127--137.
Reconstructing infinite sets of integers  
Dieter Rautenbach, Eberhard Triesch
J. Combin. Theory Ser. A 99 (2002), no. 2, 297--306.
Reconstruction up to isometries  
Dieter Rautenbach, Eberhard Triesch
Discrete Math. 259 (2002), no. 1-3, 331--336.
How local irregularity gets global in a graph  
Dieter Rautenbach, Lutz Volkmann
J. Graph Theory 41 (2002), no. 1, 18--23.
Independent domination and matchings in graphs  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 259 (2002), no. 1-3, 325--330.
 
Publikationen 2001
A note on igamma(1)-perfect graphs  
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 234 (2001), no. 1-3, 133--138.
 
Publikationen 2000
Some results on graph parameters in weighted graphs  
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
In 6th International Conference on Graph Theory (Marseille, 2000), Elsevier (2000), 4 pp. (electron.
A characterization of (Gamma)(alpha)(k)-perfect graphs  
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 224 (2000), no. 1-3, 265--271.
 
Publikationen 1998
Some structural results on linear arboricity  
Dieter Rautenbach, Lutz Volkmann
Australas. J. Combin. 17 (1998), 267--274.
The domatic number of block-cactus graphs  
Dieter Rautenbach, Lutz Volkmann
Discrete Math. 187 (1998), no. 1-3, 185--193.