Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (714 Publikationen)
«   20   21   22   23   24   25   26   27   28   29   30   31   32   33   34     »
 
Publications 2003
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.
Cactus graphs with unique minimum dominating sets  
Miranca Fischermann, Lutz Volkmann
Util. Math. 63 (2003), 229--238.
Unique independence, upper domination and upper irredundance in graphs  
Miranca Fischermann, Lutz Volkmann
J. Combin. Math. Combin. Comput. 47 (2003), 237--249.
Maximally edge-connected digraphs  
Angelika Hellwig, Lutz Volkmann
Australas. J. Combin. 27 (2003), 23--32.
Bidirected/unidirected capacity installation in telecommunication networks  
C.P.M. van Hoesel, Arie M.C.A. Koster, R.L.M.J. van de Leensel, M. W. P. Savelsbergh
Discrete Applied Mathematics 133 (2003), 103--121.
Existence and uniqueness of open-loop Nash equilibria in linear-quadratic discrete-time games  
Gerhard Jank, Hisham Abou-Kandil
IEEE Trans. Automat. Control 48 (2003), no. 2, 267--271.
Superdominance order and distance of trees with bounded maximum degree  
Frank Jelen, Eberhard Triesch
Discrete Appl. Math. 125 (2003), no. 2-3, 225--233.
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.
Restricted edge-connectivity and minimum edge-degree  
Nicola Ueffing, Lutz Volkmann
Ars Combin. 66 (2003), 193--203.
Cycles of length four through a given arc in almost regular multipartite tournaments  
Lutz Volkmann
Ars Combin. 68 (2003), 181--192.
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number  
Lutz Volkmann
J. Graph Theory 42 (2003), no. 3, 234--245.
Degree sequence conditions for super-edge-connected graphs and digraphs  
Lutz Volkmann
Ars Combin. 67 (2003), 237--249.
Cycles through a given arc in almost regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 27 (2003), 223--245.
 
Publications 2002
Edge-cuts leaving components of order at least three  
Paul Bonsma, Nicola Ueffing, Lutz Volkmann
Discrete Math. 256 (2002), no. 1-2, 431--439.
Weighted domination in triangle-free graphs  
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
Discrete Math. 250 (2002), no. 1-3, 233--239.

Gesamte Liste anzeigen (714 Publikationen)
«   20   21   22   23   24   25   26   27   28   29   30   31   32   33   34     »