Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (746 Publikationen)
«   21   22   23   24   25   26   27   28   29   30   31   32   33   34   35     »
 
Publications 2004
The Petersen graph is not 1-factorable  
Lutz Volkmann
Discrete Math. 287 (2004), no. 1-3, 193--194.
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc  
Lutz Volkmann, Stefan Winzen
Discrete Math. 285 (2004), no. 1-3, 267--278.
Close to regular multipartite tournaments containing a Hamiltonian path  
Lutz Volkmann, Stefan Winzen
J. Combin. Math. Combin. Comput. 49 (2004), 195--210.
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 283 (2004), no. 1-3, 217--229.
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments  
Lutz Volkmann, Anders Yeo
Discrete Math. 281 (2004), no. 1-3, 267--276.
Almost regular multipartite tournaments  
Stefan Winzen
In Erster Aachener Tag der Graphentheorie, Rheinisch-Westfälisch Technische Hochschule Aachen (2004), 41--46.
Strong subtournaments of close to regular multipartite tournaments  
Stefan Winzen
Australas. J. Combin. 29 (2004), 49--57.
 
Publications 2003
Models and Solution Techniques for the Frequency Assignment Problem  
K.I. Aardal, C.P.M. van Hoesel, Arie M.C.A. Koster, C. Mannino, A. Sassano
4OR 1 (2003), no. 4, 261--317.
Matrix Riccati equations  
Hisham Abou-Kandil, Gerhard Freiling, Vlad Ionescu, Gerhard Jank
, Birkh (2003).
Kosten- und Qualitätsoptimierung in Kommunikationsnetzen  
A. Bley, Arie M.C.A. Koster, A. Kröller, R. Wessälly, A. Zymolka
TeleKommunikation Aktuell 57 (2003), no. 07+08, 1--62.
Minimum degree conditions for the overfull conjecture for odd order graphs  
Kerstin Bongard, Arne Hoffmann, Lutz Volkmann
Australas. J. Combin. 28 (2003), 121--129.
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.
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.

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