Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (743 Publikationen)
«   12   13   14   15   16   17   18   19   20   21   22   23   24   25   26     »
 
Publications 2010
Independence and global offensive alliance in graphs  
Mustapha Chellali, Lutz Volkmann
Australas. J. Combin 47 (2010), 125--131.
The diameter of almost Eulerian digraphs  
Peter Dankelmann, Lutz Volkmann
Electron. J. Combin. 17 (2010), no. R 157, 11 pp.
Proof of a conjecture on game domination  
Odile Favaron, H. Karami, R. Khoeilar, S.M. Sheikholeslami, Lutz Volkmann
J. Graph Theory 64 (2010), 323--329.
Signed (b,k)-matchings in graphs  
A.N. Ghameshlou, R. Saei, S.M. Sheikholeslami, Lutz Volkmann
An. Stiint. Univ. ``Ovidius" Constanta Ser. Mat. 18 (2010), no. (1), 127--138.
A general method in the theory of domination in graphs  
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
Int. J. Comput. Math. 87 (2010), no. 13, 2915--2924.
On the geodetic and geodetic domination numbers of a graph  
Adriana Hansberg, Lutz Volkmann
Discrete Math. 310 (2010), 2140--2146.
On local connectivity of graphs with given clique number  
A. Holtkamp, Lutz Volkmann
J. Graph Theory 63 (2010), 192--197.
Graphs and Algorithms in Communication Networks on Seven League Boots  
Arie M.C.A. Koster, X. Muñoz
In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 1--59.
Branch-and-cut techniques for solving realistic two-layer network designproblems  
Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel, P. Belotti
In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 95--118.
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three   Mei10.pdf Mei10.pdf
Dirk Meierling
Discrete Math. 310 (2010), no. 13-14, 1940--1948.
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments  
Dirk Meierling
J. Graph Theory 63 (2010), no. 1, 82--92.
Cycle factors in strongly connected local tournaments  
Dirk Meierling, Lutz Volkmann
Discrete Math. 310 (2010), no. 4, 850--860.
Signed (k,k)-domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
Ann. Math. Inform. 37 (2010), 139--149.
Signed total (k,k)-domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
AKCE Int. J. Graphs Comb. 7 (2010), 189--199.
Signed total k-domination numbers of directed graphs  
S.M. Sheikholeslami, Lutz Volkmann
An. Stiint. Univ. ``Ovidius" Constanta Ser. Mat. 18 (2010), no. (2), 241--252.
The Roman domatic number of a graph  
S.M. Sheikholeslami, Lutz Volkmann
Appl. Math. Lett. 23 (2010), 1295--1300.
A Better Bouncer’s Algorithm  
Eberhard Triesch, Ferdinando Cicalese, Travis Gagie, Anthony J. Macula
Proceedings
An asymptotic bound for the complexity of monotone graph properties  
Eberhard Triesch, Torsten Korneffel
Combinatorica 30 (2010), no. 6, 735-743.
A bound on the k-domination number of a graph  
Lutz Volkmann
Czechoslovak Math. J. 60 (2010), 77--83.
Nordhaus-Gaddum bounds for domination sums of graphs with minimum degree at least two or three  
Lutz Volkmann
Util. Math. 82 (2010), 3--10.

Gesamte Liste anzeigen (743 Publikationen)
«   12   13   14   15   16   17   18   19   20   21   22   23   24   25   26     »