Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (747 Publikationen)
«   13   14   15   16   17   18   19   20   21   22   23   24   25   26   27     »
 
Publications 2010
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.
On almost 1-extendable graphs  
Lutz Volkmann
Australas. J. Combin. 47 (2010), 83--89.
Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number  
Lutz Volkmann
Ars Combin. 96 (2010), 105--114.
On the path covering number of given subdigraphs of regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
J. Combin. Math. Combin. Comput. 72 (2010), 211--230.
Smallest close to regular bipartite graphs without an almost perfect matching  
Lutz Volkmann, Axel Zingsem
Acta Math. Sin. (Engl. Ser.) 26 (2010), 1403--1412.
 
Publications 2009
The Exact Subgraph Recoverable Robust Shortest Path Problem  
Christina Büsing
In Robust and Online Large-Scale Optimization, Springer (2009), 231 -- 248.
Bounds on the global offensive k-alliance number in graphs  
Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann
Discuss. Math. Graph Theory, 29 (2009), 597--613.
Global offensive alliance numbers in graphs with emphasis on trees  
Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann
Australas. J. Combin. 45 (2009), 87--96.
Inverse degree and edge-connectivity  
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
Discrete Math. 309 (2009), 2943--2947.
Minimum size of a graph or digraph of given radius  
Peter Dankelmann, Lutz Volkmann
Inform. Process. Lett. 109 (2009), 971--973.
Searching for an edge in a graph with restricted test sets  
Tatjana Gerzen
Discrete Math. 309 (2009), no. 6, 1334--1346.
A characterization of even order trees with domination number half their order minus one  
Adriana Hansberg, Lutz Volkmann
Australas. J. Combin. 44 (2009), 247--254.
Lower bounds on the p-domination number in terms of cycles and matching number  
Adriana Hansberg, Lutz Volkmann
J. Combin. Math. Combin. Comput. 68 (2009), 245--255.
Upper bounds on the k-domination number and the k-Roman domination number  
Adriana Hansberg, Lutz Volkmann
Discrete Appl. Math. 157 (2009), no. 7, 1634--1639.
Complementary cycles in regular multipartite tournaments, where one cycle has length five  
Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
Discrete Math. 309 (2009), 3131--3149.
On the connectivity of p-diamond-free graphs  
A. Holtkamp, Lutz Volkmann
Discrete Math. 309 (2009), 6065--6069.
Roman k-domination in graphs  
K. Kaemmerling, Lutz Volkmann
J. Korean Math. Soc. 46 (2009), 1309--1318.

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