| 2008 |
|---|
| 105 | EE | Lutz Volkmann:
On local connectivity of graphs.
Appl. Math. Lett. 21(1): 63-66 (2008) |
| 104 | | Irene 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) |
| 103 | EE | Angelika Hellwig,
Lutz Volkmann:
The connectivity of a graph and its complement.
Discrete Applied Mathematics 156(17): 3325-3328 (2008) |
| 102 | EE | Dirk Meierling,
Lutz Volkmann:
All 2-connected in-tournaments that are cycle complementary.
Discrete Mathematics 308(11): 2115-2133 (2008) |
| 101 | EE | Adriana Hansberg,
Lutz Volkmann:
On graphs with equal domination and 2-domination numbers.
Discrete Mathematics 308(11): 2277-2281 (2008) |
| 100 | EE | F. Dahme,
Dieter Rautenbach,
Lutz Volkmann:
alpha-Domination perfect trees.
Discrete Mathematics 308(15): 3187-3198 (2008) |
| 99 | EE | Angelika Hellwig,
Lutz Volkmann:
Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Discrete Mathematics 308(15): 3265-3296 (2008) |
| 98 | EE | Lutz Volkmann,
Stefan Winzen:
Strong subtournaments containing a given vertex in regular multipartite tournaments.
Discrete Mathematics 308(23): 5516-5521 (2008) |
| 97 | EE | Dieter Rautenbach,
Lutz Volkmann:
Some remarks on lambdap, q-connectedness.
Discrete Mathematics 308(23): 5562-5569 (2008) |
| 96 | EE | Dirk Meierling,
Lutz Volkmann:
On arc-traceable local tournaments.
Discrete Mathematics 308(24): 6513-6526 (2008) |
| 95 | EE | Lutz 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) |
| 94 | EE | Odile Favaron,
Adriana Hansberg,
Lutz Volkmann:
On k-domination and minimum degree in graphs.
Journal of Graph Theory 57(1): 33-40 (2008) |
| 93 | EE | Dieter Rautenbach,
Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks 52(4): 252-255 (2008) |
| 2007 |
|---|
| 92 | EE | Dieter Rautenbach,
Lutz Volkmann:
New bounds on the k-domination number and the k-tuple domination number.
Appl. Math. Lett. 20(1): 98-102 (2007) |
| 91 | EE | Lutz Volkmann:
A remark on cycles through an arc in strongly connected multipartite tournaments.
Appl. Math. Lett. 20(11): 1148-1150 (2007) |
| 90 | | Peter Dankelmann,
Lutz Volkmann:
Average distance in bipartite tournaments.
Ars Comb. 83: (2007) |
| 89 | | Sabine Klinkenberg,
Lutz Volkmann:
On the order of close to regular graphs without a matching of given size.
Ars Comb. 85: (2007) |
| 88 | EE | Peter Dankelmann,
Angelika Hellwig,
Lutz Volkmann:
On the connectivity of diamond-free graphs.
Discrete Applied Mathematics 155(16): 2111-2117 (2007) |
| 87 | EE | Lutz Volkmann:
Multipartite tournaments: A survey.
Discrete Mathematics 307(24): 3097-3129 (2007) |
| 86 | EE | Lutz Volkmann:
Local-edge-connectivity in digraphs and oriented graphs.
Discrete Mathematics 307(24): 3207-3212 (2007) |
| 85 | EE | Irene Stella,
Lutz Volkmann,
Stefan Winzen:
Strongly 4-path-connectivity in almost regular multipartite tournaments.
Discrete Mathematics 307(24): 3213-3219 (2007) |
| 84 | EE | Lutz Volkmann:
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs.
Electr. J. Comb. 14(1): (2007) |
| 83 | EE | Adriana Hansberg,
Dirk Meierling,
Lutz Volkmann:
Distance Domination and Distance Irredundance in Graphs.
Electr. J. Comb. 14(1): (2007) |
| 82 | EE | Lutz Volkmann:
Restricted arc-connectivity of digraphs.
Inf. Process. Lett. 103(6): 234-239 (2007) |
| 2006 |
|---|
| 81 | EE | Lutz Volkmann:
Degree sequence conditions for maximally edge-connected oriented graphs.
Appl. Math. Lett. 19(11): 1255-1260 (2006) |
| 80 | | Lutz Volkmann:
Upper bounds on the domination number of a graph in terms of order and minimum degree.
Ars Comb. 81: (2006) |
| 79 | EE | Lutz Volkmann,
Stefan Winzen:
On the connectivity of close to regular multipartite tournaments.
Discrete Applied Mathematics 154(9): 1437-1452 (2006) |
| 78 | EE | Lutz Volkmann:
On cycles in regular 3-partite tournaments.
Discrete Mathematics 306(12): 1198-1206 (2006) |
| 77 | EE | Mostafa Blidia,
Mustapha Chellali,
Lutz Volkmann:
Some bounds on the p-domination number in trees.
Discrete Mathematics 306(17): 2031-2037 (2006) |
| 76 | EE | Lutz 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) |
| 75 | EE | Lutz Volkmann:
Longest cycles in almost regular 3-partite tournaments.
Discrete Mathematics 306(22): 2931-2942 (2006) |
| 74 | EE | Angelika Hellwig,
Lutz Volkmann:
Lower bounds on the vertex-connectivity of digraphs and graphs.
Inf. Process. Lett. 99(2): 41-46 (2006) |
| 73 | EE | Paul Butzer,
Lutz Volkmann:
Otto Blumenthal (1876-1944) in retrospect.
Journal of Approximation Theory 138(1): 1-36 (2006) |
| 72 | EE | Angelika Hellwig,
Lutz Volkmann:
On connectivity in graphs with given clique number.
Journal of Graph Theory 52(1): 7-14 (2006) |
| 2005 |
|---|
| 71 | | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Extremal Trees with Respect to Dominance Order.
Ars Comb. 76: (2005) |
| 70 | | Peter Dankelmann,
Lutz Volkmann:
Average distance in k-connected tournaments.
Ars Comb. 77: (2005) |
| 69 | EE | Miranca 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) |
| 68 | EE | Lutz Volkmann,
Bohdan Zelinka:
Signed domatic number of a graph.
Discrete Applied Mathematics 150(1-3): 261-267 (2005) |
| 67 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Cuts leaving components of given minimum order.
Discrete Mathematics 292(1-3): 55-65 (2005) |
| 66 | EE | Miranca Fischermann,
Lutz Volkmann,
Igor E. Zverovich:
Unique irredundance, domination and independent domination in graphs.
Discrete Mathematics 305(1-3): 190-200 (2005) |
| 65 | EE | Arne Hoffmann,
Lutz Volkmann:
Structural Remarks on Bipartite Graphs with Unique f-Factors.
Graphs and Combinatorics 21(4): 421-425 (2005) |
| 64 | EE | Angelika 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 |
|---|
| 63 | | Angelika Hellwig,
Lutz Volkmann:
Maximally local-edge-connected graphs and digraphs.
Ars Comb. 72: (2004) |
| 62 | EE | Lutz Volkmann:
The Maximum Size Of Graphs With A Unique k- Factor.
Combinatorica 24(3): 531-540 (2004) |
| 61 | EE | Mustapha Chellali,
Lutz Volkmann:
Relations between the lower domination parameters and the chromatic number of a graph.
Discrete Mathematics 274(1-3): 1-8 (2004) |
| 60 | EE | Arne Hoffmann,
Lutz Volkmann:
On unique k-factors and unique [1, k]-factors in graphs.
Discrete Mathematics 278(1-3): 127-138 (2004) |
| 59 | EE | Lutz Volkmann:
All regular multipartite tournaments that are cycle complementary.
Discrete Mathematics 281(1-3): 255-266 (2004) |
| 58 | EE | Lutz 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) |
| 57 | EE | Angelika Hellwig,
Lutz Volkmann:
Sufficient conditions for lambda'-optimality in graphs of diameter 2.
Discrete Mathematics 283(1-3): 113-120 (2004) |
| 56 | EE | Lutz 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) |
| 55 | EE | Christian Peters,
Lutz Volkmann:
Vertex 6-pancyclic in-tournaments.
Discrete Mathematics 285(1-3): 227-238 (2004) |
| 54 | EE | Lutz Volkmann,
Stefan Winzen:
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
Discrete Mathematics 285(1-3): 267-278 (2004) |
| 53 | EE | Lutz Volkmann:
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments.
Discrete Mathematics 285(1-3): 359-364 (2004) |
| 52 | EE | Lutz 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) |
| 51 | EE | Arne Hoffmann,
Lutz Volkmann:
On Regular Factors in Regular Graphs with Small Radius.
Electr. J. Comb. 11(1): (2004) |
| 50 | EE | Yubao Guo,
Lutz Volkmann:
Extendable Cycles in Multipartite Tournaments.
Graphs and Combinatorics 20(2): 185-190 (2004) |
| 49 | EE | Angelika Hellwig,
Dieter Rautenbach,
Lutz Volkmann:
Note on the connectivity of line graphs.
Inf. Process. Lett. 91(1): 7-10 (2004) |
| 2003 |
|---|
| 48 | | Nicola Ueffing,
Lutz Volkmann:
Restricted edge-connectivity and minimum edge-degree.
Ars Comb. 66: (2003) |
| 47 | | Lutz Volkmann:
Degree sequence conditions for super-edge-connected graphs and digraphs.
Ars Comb. 67: (2003) |
| 46 | | Lutz Volkmann:
Cycles of length four through a given arc in almost regular multipartite tournaments.
Ars Comb. 68: (2003) |
| 45 | EE | Miranca 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) |
| 44 | EE | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Maximum graphs with a unique minimum dominating set.
Discrete Mathematics 260(1-3): 197-203 (2003) |
| 43 | EE | Miranca Fischermann,
Dieter Rautenbach,
Lutz Volkmann:
Remarks on the bondage number of planar graphs.
Discrete Mathematics 260(1-3): 57-67 (2003) |
| 42 | EE | Dieter Rautenbach,
Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds.
Discrete Mathematics 263(1-3): 297-303 (2003) |
| 41 | EE | Dieter Rautenbach,
Lutz Volkmann:
On alphargammas(k)-perfect graphs.
Discrete Mathematics 270(1-3): 240-249 (2003) |
| 2002 |
|---|
| 40 | | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes,
Lutz Volkmann:
Vertex pancyclic graphs.
Discrete Applied Mathematics 120(1-3): 219-237 (2002) |
| 39 | | Miranca Fischermann,
Lutz Volkmann:
Graphs having distance-n domination number half their order.
Discrete Applied Mathematics 120(1-3): 97-107 (2002) |
| 38 | | Miranca 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) |
| 37 | EE | Meike 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) |
| 36 | EE | Lutz Volkmann:
Cycles in multipartite tournaments: results and problems.
Discrete Mathematics 245(1-3): 19-53 (2002) |
| 35 | EE | Peter Dankelmann,
Dieter Rautenbach,
Lutz Volkmann:
Weighted domination in triangle-free graphs.
Discrete Mathematics 250(1-3): 233-239 (2002) |
| 34 | EE | Lutz Volkmann,
Vadim E. Zverovich:
A disproof of Henning's conjecture on irredundance perfect graphs.
Discrete Mathematics 254(1-3): 539-554 (2002) |
| 33 | EE | Paul S. Bonsma,
Nicola Ueffing,
Lutz Volkmann:
Edge-cuts leaving components of order at least three.
Discrete Mathematics 256(1-2): 431-439 (2002) |
| 32 | EE | Lutz Volkmann:
Longest paths through an arc in strong semicomplete multipartite digraphs.
Discrete Mathematics 258(1-3): 331-337 (2002) |
| 31 | EE | Dieter Rautenbach,
Lutz Volkmann:
Independent domination and matchings in graphs.
Discrete Mathematics 259(1-3): 325-330 (2002) |
| 2001 |
|---|
| 30 | | Lutz Volkmann:
Spanning multipartite tournaments of semicomplete multipartite digraphs.
Ars Comb. 58: (2001) |
| 29 | EE | Meike Tewes,
Lutz Volkmann:
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.
Discrete Mathematics 231(1-3): 453-457 (2001) |
| 28 | EE | Lothar Dohmen,
Dieter Rautenbach,
Lutz Volkmann:
i gamma(1)-perfect graphs.
Discrete Mathematics 234(1-3): 133-138 (2001) |
| 2000 |
|---|
| 27 | EE | Peter Dankelmann,
Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs depending on the clique number.
Discrete Mathematics 211: 217-223 (2000) |
| 26 | EE | Yubao Guo,
Meike Tewes,
Lutz Volkmann,
Anders Yeo:
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Discrete Mathematics 212(1-2): 91-100 (2000) |
| 25 | EE | Lothar Dohmen,
Dieter Rautenbach,
Lutz Volkmann:
A characterization of rho alpha(k)-perfect graphs.
Discrete Mathematics 224(1-3): 265-271 (2000) |
| 24 | EE | Miranca Fischermann,
Lutz Volkmann:
Graphs with unique dominating sets.
Electronic Notes in Discrete Mathematics 5: 123-125 (2000) |
| 23 | EE | Peter Dankelmann,
Dieter Rautenbach,
Lutz Volkmann:
Some results on graph parameters in weighted graphs.
Electronic Notes in Discrete Mathematics 5: 85-88 (2000) |
| 1999 |
|---|
| 22 | EE | Meike Tewes,
Lutz Volkmann:
Vertex deletion and cycles in multipartite tournaments.
Discrete Mathematics 197-198: 769-779 (1999) |
| 21 | EE | Bert Randerath,
Lutz Volkmann,
Ingo Schiermeyer,
Meike Tewes:
Vertex Pancyclic Graphs.
Electronic Notes in Discrete Mathematics 3: 166-170 (1999) |
| 20 | EE | Miranca Fischermann,
Lutz Volkmann:
Graphs having distance-n domination number half their order.
Electronic Notes in Discrete Mathematics 3: 51-54 (1999) |
| 19 | EE | Arne Hoffmann,
Bert Randerath,
Lutz Volkmann:
Maximal Sets of 2-Factors in Complete Equipartite Graphs.
Electronic Notes in Discrete Mathematics 3: 82-85 (1999) |
| 1998 |
|---|
| 18 | EE | Lutz Volkmann:
The ratio of the irredundance and domination number of a graph.
Discrete Mathematics 178(1-3): 221-228 (1998) |
| 17 | EE | Dieter Rautenbach,
Lutz Volkmann:
The domatic number of block-cactus graphs.
Discrete Mathematics 187(1-3): 185-193 (1998) |
| 16 | EE | Bert Randerath,
Lutz Volkmann:
Characterization of graphs with equal domination and covering number.
Discrete Mathematics 191(1-3): 159-169 (1998) |
| 1997 |
|---|
| 15 | | Bert Randerath,
Lutz Volkmann:
Simplicial Graphs and Relationships to Different Graph Invariants.
Ars Comb. 46: (1997) |
| 14 | EE | Yubao Guo,
Lutz Volkmann:
Bypaths in Tournaments.
Discrete Applied Mathematics 79(1-3): 127-135 (1997) |
| 13 | EE | Yubao Guo,
Axel Pinkernell,
Lutz Volkmann:
On cycles through a given vertex in multipartite tournaments.
Discrete Mathematics 164(1-3): 165-170 (1997) |
| 12 | EE | Jørgen Bang-Jensen,
Yubao Guo,
Gregory Gutin,
Lutz Volkmann:
A classification of locally semicomplete digraphs.
Discrete Mathematics 167-168: 101-114 (1997) |
| 1996 |
|---|
| 11 | | Ursala Lenkewitz,
Lutz Volkmann:
Neighbourhood and degree conditions for the existence of regular factors.
Ars Comb. 42: (1996) |
| 10 | EE | Peter Maschlanka,
Lutz Volkmann:
Independence number in n-extendable graphs.
Discrete Mathematics 154(1-3): 167-178 (1996) |
| 9 | EE | Yubao 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 |
|---|
| 8 | EE | Lutz Volkmann:
on Graphs with Equal Domination and Covering Numbers.
Discrete Applied Mathematics 51(1-2): 211-217 (1994) |
| 7 | EE | Werner Siemes,
Jerzy Topp,
Lutz Volkmann:
On unique independent sets in graphs.
Discrete Mathematics 131(1-3): 279-285 (1994) |
| 6 | EE | Yubao Guo,
Lutz Volkmann:
On complementary cycles in locally semicomplete digraphs.
Discrete Mathematics 135(1-3): 121-127 (1994) |
| 5 | EE | Yubao Guo,
Lutz Volkmann:
Cycles in Multipartite Tournaments.
J. Comb. Theory, Ser. B 62(2): 363-366 (1994) |
| 1993 |
|---|
| 4 | EE | Jerzy 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 |
|---|
| 3 | EE | Jerzy Topp,
Lutz Volkmann:
On graphs with equal domination and independent domination numbers.
Discrete Mathematics 96(1): 75-80 (1991) |
| 2 | EE | Jerzy Topp,
Lutz Volkmann:
On packing and covering numbers of graphs.
Discrete Mathematics 96(3): 229-238 (1991) |
| 1990 |
|---|
| 1 | EE | Peter Flach,
Lutz Volkmann:
Estimations for the domination number of a graph.
Discrete Mathematics 80(2): 145-151 (1990) |
