Lutz Volkmann Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Some remarks on the signed domatic number of graphs with small minimum degree. Appl. Math. Lett. 22(8): 1166-1169 (2009)
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdriana Hansberg, Lutz Volkmann: Upper bounds on the k-domination number and the k-Roman domination number. Discrete Applied Mathematics 157(7): 1634-1639 (2009)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDirk Meierling, Lutz Volkmann, Stephan Zitzen: The signed domatic number of some regular graphs. Discrete Applied Mathematics 157(8): 1905-1912 (2009)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009)
2008
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: On local connectivity of graphs. Appl. Math. Lett. 21(1): 63-66 (2008)
104no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrene Stella, Lutz Volkmann, Stefan Winzen: How close to regular must a multipartite tournament be to secure a given path covering number? Ars Comb. 87: (2008)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: The connectivity of a graph and its complement. Discrete Applied Mathematics 156(17): 3325-3328 (2008)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDirk Meierling, Lutz Volkmann: All 2-connected in-tournaments that are cycle complementary. Discrete Mathematics 308(11): 2115-2133 (2008)
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdriana Hansberg, Lutz Volkmann: On graphs with equal domination and 2-domination numbers. Discrete Mathematics 308(11): 2277-2281 (2008)
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLF. Dahme, Dieter Rautenbach, Lutz Volkmann: alpha-Domination perfect trees. Discrete Mathematics 308(15): 3187-3198 (2008)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Discrete Mathematics 308(15): 3265-3296 (2008)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: Strong subtournaments containing a given vertex in regular multipartite tournaments. Discrete Mathematics 308(23): 5516-5521 (2008)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: Some remarks on lambdap, q-connectedness. Discrete Mathematics 308(23): 5562-5569 (2008)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDirk Meierling, Lutz Volkmann: On arc-traceable local tournaments. Discrete Mathematics 308(24): 6513-6526 (2008)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. Discrete Mathematics 308(9): 1710-1721 (2008)
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOdile Favaron, Adriana Hansberg, Lutz Volkmann: On k-domination and minimum degree in graphs. Journal of Graph Theory 57(1): 33-40 (2008)
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008)
2007
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: New bounds on the k-domination number and the k-tuple domination number. Appl. Math. Lett. 20(1): 98-102 (2007)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: A remark on cycles through an arc in strongly connected multipartite tournaments. Appl. Math. Lett. 20(11): 1148-1150 (2007)
90no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Average distance in bipartite tournaments. Ars Comb. 83: (2007)
89no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSabine Klinkenberg, Lutz Volkmann: On the order of close to regular graphs without a matching of given size. Ars Comb. 85: (2007)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Angelika Hellwig, Lutz Volkmann: On the connectivity of diamond-free graphs. Discrete Applied Mathematics 155(16): 2111-2117 (2007)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Multipartite tournaments: A survey. Discrete Mathematics 307(24): 3097-3129 (2007)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Local-edge-connectivity in digraphs and oriented graphs. Discrete Mathematics 307(24): 3207-3212 (2007)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrene Stella, Lutz Volkmann, Stefan Winzen: Strongly 4-path-connectivity in almost regular multipartite tournaments. Discrete Mathematics 307(24): 3213-3219 (2007)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. Electr. J. Comb. 14(1): (2007)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdriana Hansberg, Dirk Meierling, Lutz Volkmann: Distance Domination and Distance Irredundance in Graphs. Electr. J. Comb. 14(1): (2007)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Restricted arc-connectivity of digraphs. Inf. Process. Lett. 103(6): 234-239 (2007)
2006
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Degree sequence conditions for maximally edge-connected oriented graphs. Appl. Math. Lett. 19(11): 1255-1260 (2006)
80no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Upper bounds on the domination number of a graph in terms of order and minimum degree. Ars Comb. 81: (2006)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: On the connectivity of close to regular multipartite tournaments. Discrete Applied Mathematics 154(9): 1437-1452 (2006)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: On cycles in regular 3-partite tournaments. Discrete Mathematics 306(12): 1198-1206 (2006)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostafa Blidia, Mustapha Chellali, Lutz Volkmann: Some bounds on the p-domination number in trees. Discrete Mathematics 306(17): 2031-2037 (2006)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: Paths with a given number of vertices from each partite set in regular multipartite tournaments. Discrete Mathematics 306(21): 2724-2732 (2006)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Longest cycles in almost regular 3-partite tournaments. Discrete Mathematics 306(22): 2931-2942 (2006)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Lower bounds on the vertex-connectivity of digraphs and graphs. Inf. Process. Lett. 99(2): 41-46 (2006)
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul L. Butzer, Lutz Volkmann: Otto Blumenthal (1876-1944) in retrospect. Journal of Approximation Theory 138(1): 1-36 (2006)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: On connectivity in graphs with given clique number. Journal of Graph Theory 52(1): 7-14 (2006)
2005
71no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Extremal Trees with Respect to Dominance Order. Ars Comb. 76: (2005)
70no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Average distance in k-connected tournaments. Ars Comb. 77: (2005)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Lutz Volkmann, Dieter Rautenbach: A note on the number of matchings and independent sets in trees. Discrete Applied Mathematics 145(3): 483-489 (2005)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Bohdan Zelinka: Signed domatic number of a graph. Discrete Applied Mathematics 150(1-3): 261-267 (2005)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Cuts leaving components of given minimum order. Discrete Mathematics 292(1-3): 55-65 (2005)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Lutz Volkmann, Igor E. Zverovich: Unique irredundance, domination and independent domination in graphs. Discrete Mathematics 305(1-3): 190-200 (2005)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne Hoffmann, Lutz Volkmann: Structural Remarks on Bipartite Graphs with Unique f-Factors. Graphs and Combinatorics 21(4): 421-425 (2005)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. Journal of Graph Theory 48(3): 228-246 (2005)
2004
63no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Maximally local-edge-connected graphs and digraphs. Ars Comb. 72: (2004)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: The Maximum Size Of Graphs With A Unique k- Factor. Combinatorica 24(3): 531-540 (2004)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMustapha Chellali, Lutz Volkmann: Relations between the lower domination parameters and the chromatic number of a graph. Discrete Mathematics 274(1-3): 1-8 (2004)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne Hoffmann, Lutz Volkmann: On unique k-factors and unique [1, k]-factors in graphs. Discrete Mathematics 278(1-3): 127-138 (2004)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: All regular multipartite tournaments that are cycle complementary. Discrete Mathematics 281(1-3): 255-266 (2004)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Anders Yeo: Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Discrete Mathematics 281(1-3): 267-276 (2004)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Lutz Volkmann: Sufficient conditions for lambda'-optimality in graphs of diameter 2. Discrete Mathematics 283(1-3): 113-120 (2004)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. Discrete Mathematics 283(1-3): 217-229 (2004)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Peters, Lutz Volkmann: Vertex 6-pancyclic in-tournaments. Discrete Mathematics 285(1-3): 227-238 (2004)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Stefan Winzen: Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. Discrete Mathematics 285(1-3): 267-278 (2004)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. Discrete Mathematics 285(1-3): 359-364 (2004)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326]. Discrete Mathematics 287(1-3): 193-194 (2004)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne Hoffmann, Lutz Volkmann: On Regular Factors in Regular Graphs with Small Radius. Electr. J. Comb. 11(1): (2004)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Lutz Volkmann: Extendable Cycles in Multipartite Tournaments. Graphs and Combinatorics 20(2): 185-190 (2004)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAngelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004)
2003
48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicola Ueffing, Lutz Volkmann: Restricted edge-connectivity and minimum edge-degree. Ars Comb. 66: (2003)
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Comb. 67: (2003)
46no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Cycles of length four through a given arc in almost regular multipartite tournaments. Ars Comb. 68: (2003)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann: A Linear-programming Approach to the Generalized Randic Index. Discrete Applied Mathematics 128(2-3): 375-385 (2003)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Maximum graphs with a unique minimum dominating set. Discrete Mathematics 260(1-3): 197-203 (2003)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Remarks on the bondage number of planar graphs. Discrete Mathematics 260(1-3): 57-67 (2003)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: Extremal subgraphs with respect to vertex degree bounds. Discrete Mathematics 263(1-3): 297-303 (2003)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: On alphargammas(k)-perfect graphs. Discrete Mathematics 270(1-3): 240-249 (2003)
2002
40no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann: Vertex pancyclic graphs. Discrete Applied Mathematics 120(1-3): 219-237 (2002)
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Lutz Volkmann: Graphs having distance-n domination number half their order. Discrete Applied Mathematics 120(1-3): 97-107 (2002)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann: Wiener index versus maximum degree in trees. Discrete Applied Mathematics 122(1-3): 127-137 (2002)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMeike Tewes, Lutz Volkmann, Anders Yeo: Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. Discrete Mathematics 242(1-3): 201-228 (2002)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Cycles in multipartite tournaments: results and problems. Discrete Mathematics 245(1-3): 19-53 (2002)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Weighted domination in triangle-free graphs. Discrete Mathematics 250(1-3): 233-239 (2002)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann, Vadim E. Zverovich: A disproof of Henning's conjecture on irredundance perfect graphs. Discrete Mathematics 254(1-3): 539-554 (2002)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul S. Bonsma, Nicola Ueffing, Lutz Volkmann: Edge-cuts leaving components of order at least three. Discrete Mathematics 256(1-2): 431-439 (2002)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Longest paths through an arc in strong semicomplete multipartite digraphs. Discrete Mathematics 258(1-3): 331-337 (2002)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: Independent domination and matchings in graphs. Discrete Mathematics 259(1-3): 325-330 (2002)
2001
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: Spanning multipartite tournaments of semicomplete multipartite digraphs. Ars Comb. 58: (2001)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMeike Tewes, Lutz Volkmann: The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. Discrete Mathematics 231(1-3): 453-457 (2001)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLothar Dohmen, Dieter Rautenbach, Lutz Volkmann: i gamma(1)-perfect graphs. Discrete Mathematics 234(1-3): 133-138 (2001)
2000
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Mathematics 211: 217-223 (2000)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo: Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. Discrete Mathematics 212(1-2): 91-100 (2000)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLothar Dohmen, Dieter Rautenbach, Lutz Volkmann: A characterization of rho alpha(k)-perfect graphs. Discrete Mathematics 224(1-3): 265-271 (2000)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Lutz Volkmann: Graphs with unique dominating sets. Electronic Notes in Discrete Mathematics 5: 123-125 (2000)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Some results on graph parameters in weighted graphs. Electronic Notes in Discrete Mathematics 5: 85-88 (2000)
1999
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMeike Tewes, Lutz Volkmann: Vertex deletion and cycles in multipartite tournaments. Discrete Mathematics 197-198: 769-779 (1999)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes: Vertex Pancyclic Graphs. Electronic Notes in Discrete Mathematics 3: 166-170 (1999)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMiranca Fischermann, Lutz Volkmann: Graphs having distance-n domination number half their order. Electronic Notes in Discrete Mathematics 3: 51-54 (1999)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne Hoffmann, Bert Randerath, Lutz Volkmann: Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electronic Notes in Discrete Mathematics 3: 82-85 (1999)
1998
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: The ratio of the irredundance and domination number of a graph. Discrete Mathematics 178(1-3): 221-228 (1998)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDieter Rautenbach, Lutz Volkmann: The domatic number of block-cactus graphs. Discrete Mathematics 187(1-3): 185-193 (1998)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Randerath, Lutz Volkmann: Characterization of graphs with equal domination and covering number. Discrete Mathematics 191(1-3): 159-169 (1998)
1997
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBert Randerath, Lutz Volkmann: Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46: (1997)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Lutz Volkmann: Bypaths in Tournaments. Discrete Applied Mathematics 79(1-3): 127-135 (1997)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Axel Pinkernell, Lutz Volkmann: On cycles through a given vertex in multipartite tournaments. Discrete Mathematics 164(1-3): 165-170 (1997)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997)
1996
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUrsala Lenkewitz, Lutz Volkmann: Neighbourhood and degree conditions for the existence of regular factors. Ars Comb. 42: (1996)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Maschlanka, Lutz Volkmann: Independence number in n-extendable graphs. Discrete Mathematics 154(1-3): 167-178 (1996)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Lutz Volkmann: A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments. J. Comb. Theory, Ser. B 66(1): 140-145 (1996)
1994
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLutz Volkmann: on Graphs with Equal Domination and Covering Numbers. Discrete Applied Mathematics 51(1-2): 211-217 (1994)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWerner Siemes, Jerzy Topp, Lutz Volkmann: On unique independent sets in graphs. Discrete Mathematics 131(1-3): 279-285 (1994)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Lutz Volkmann: On complementary cycles in locally semicomplete digraphs. Discrete Mathematics 135(1-3): 121-127 (1994)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYubao Guo, Lutz Volkmann: Cycles in Multipartite Tournaments. J. Comb. Theory, Ser. B 62(2): 363-366 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJerzy Topp, Lutz Volkmann: Some upper bounds for the product of the domination number and the chromatic number of a graph. Discrete Mathematics 118(1-3): 289-292 (1993)
1991
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJerzy Topp, Lutz Volkmann: On graphs with equal domination and independent domination numbers. Discrete Mathematics 96(1): 75-80 (1991)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJerzy Topp, Lutz Volkmann: On packing and covering numbers of graphs. Discrete Mathematics 96(3): 229-238 (1991)
1990
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Flach, Lutz Volkmann: Estimations for the domination number of a graph. Discrete Mathematics 80(2): 145-151 (1990)

Coauthor Index

1Jørgen Bang-Jensen [12]
2Mostafa Blidia [77]
3Paul S. Bonsma [33]
4P. L. Butzer (Paul L. Butzer) [73]
5Mustapha Chellali [61] [77]
6F. Dahme [100]
7Peter Dankelmann [23] [27] [35] [70] [88] [90] [106]
8Lothar Dohmen [25] [28]
9Odile Favaron [94]
10Miranca Fischermann [20] [24] [38] [39] [43] [44] [45] [66] [69] [71]
11Peter Flach [1]
12Yubao Guo [5] [6] [9] [12] [13] [14] [26] [50]
13Gregory Gutin [12]
14Adriana Hansberg [83] [94] [101] [108]
15Angelika Hellwig [49] [57] [63] [64] [67] [72] [74] [88] [99] [103]
16Arne Hoffmann [19] [38] [45] [51] [60] [65]
17Sabine Klinkenberg [89]
18Ursala Lenkewitz [11]
19Peter Maschlanka [10]
20Dirk Meierling [83] [96] [102] [107]
21Christian Peters [55]
22Axel Pinkernell [13]
23Bert Randerath [15] [16] [19] [21] [40]
24Dieter Rautenbach [17] [23] [25] [28] [31] [35] [38] [41] [42] [43] [44] [45] [49] [67] [69] [71] [92] [93] [97] [100]
25Ingo Schiermeyer [21] [40]
26Werner Siemes [7]
27Irene Stella [85] [104]
28László A. Székely [38]
29Meike Tewes [21] [22] [26] [29] [37] [40]
30Jerzy Topp [2] [3] [4] [7]
31Nicola Ueffing [33] [48]
32Stefan Winzen [54] [56] [76] [79] [85] [95] [98] [104]
33Anders Yeo [26] [37] [58]
34Bohdan Zelinka [68]
35Stephan Zitzen [107]
36Igor E. Zverovich [66]
37Vadim E. Zverovich [34]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)