Publikationen des Lehrstuhl II für Mathematik

Autor: Titel: Jahr: Zeige:

Schliesse Diplom- und Masterarbeiten, Tech Reports, Proceedings ein

Gesamte Liste anzeigen (746 Publikationen)
«   15   16   17   18   19   20   21   22   23   24   25   26   27   28   29     »
 
Publications 2008
Holomorphic functions in the plane and $n$-dimensional space  
Klaus Gürlebeck, Klaus Habetha, Wolfgang Sprößig
, Birkh (2008).
Characterization of unicyclic graphs with equal 2-domination number and domination number plus one  
Adriana Hansberg, Lutz Volkmann
Util. Math. 77 (2008), 265--276.
On graphs with equal domination and 2-domination numbers  
Adriana Hansberg, Lutz Volkmann
Discrete Math. 308 (2008), no. 11, 2277--2281.
Maximally edge-connected and vertex-connected graphs and digraphs: a survey  
Angelika Hellwig, Lutz Volkmann
Discrete Math. 308 (2008), no. 15, 3265--3296.
The connectivity of a graph and its complement  
Angelika Hellwig, Lutz Volkmann
Discrete Appl. Math. 156 (2008), no. 17, 3325--3328.
A remark on the (2,2)-domination number  
Torsten Korneffel, Dirk Meierling, Lutz Volkmann
Discuss. Math. Graph Theory 28 (2008), no. 2, 361--366.
Single-Layer Cuts for Multi-Layer Network Design Problems  
Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel
In Telecommunications Modeling, Policy, and Technology, Springer (S. Raghavan, Bruce Golden, Edward Wasil, eds.) (2008), 1--23.
Comparing Imperfection Ratio and Imperfection Index for Graph Classes  
Arie M.C.A. Koster, A.K. Wagler
RAIRO -- Operations Research 42 (2008), 485--500.
All 2-connected in-tournaments that are cycle complementary  
Dirk Meierling, Lutz Volkmann
Discrete Math. 308 (2008), no. 11, 2115--2133.
On arc-traceable local tournaments  
Dirk Meierling, Lutz Volkmann
Discrete Math. 308 (2008), no. 24, 6513--6526.
Restricted arc-connectivity of generalized tournaments  
Dirk Meierling, Lutz Volkmann, Stefan Winzen
Australas. J. Combin. 40 (2008), 269--278.
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.
How close to regular must a multipartite tournament be to secure a given path covering number?  
Irene Stella, Lutz Volkmann, Stefan Winzen
Ars Combin. 87 (2008), 359--375.
A characterization of bipartite graphs with independence number half their order  
Lutz Volkmann
Australas. J. Combin. 41 (2008), 219--222.
A Nordhaus-Gaddum-type result for the 2-domination number  
Lutz Volkmann
J. Combin. Math. Combin. Comput. 64 (2008), 227--235.
On local connectivity of graphs  
Lutz Volkmann
Appl. Math. Lett. 21 (2008), no. 1, 63--66.
Almost regular c-partite tournaments contain a strong subtournament of order c when c>=5  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 9, 1710--1721.
Strong subtournaments containing a given vertex in regular multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Discrete Math. 308 (2008), no. 23, 5516--5521.
Weakly complementary cycles in 3-connected multipartite tournaments  
Lutz Volkmann, Stefan Winzen
Kyungpook Math. J. 48 (2008), no. 2, 287--302.

Gesamte Liste anzeigen (746 Publikationen)
«   15   16   17   18   19   20   21   22   23   24   25   26   27   28   29     »