Lutz Volkmann

Nader Jafari Rad, Lutz Volkmann: Roman Domination Dot-critical Graphs. Graphs and Combinatorics 29(3): 527-533 (2013)

Lutz Volkmann: The smallest regular graphs which are not 1-extendable. Ars Comb. 104: 179-184 (2012)

Lutz Volkmann: On regular (2, q)-extendable graphs. Ars Comb. 105: 53-64 (2012)

Dirk Meierling, Lutz Volkmann: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. Discrete Applied Mathematics 160(12): 1775-1781 (2012)

Lutz Volkmann: Signed 2-independence in digraphs. Discrete Mathematics 312(2): 465-471 (2012)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: Signed total {k}-domination and {k}-Domatic numbers of Graphs. Discrete Math., Alg. and Appl. 4(1) (2012)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The k-rainbow domatic number of a graph. Discussiones Mathematicae Graph Theory 32(1): 129-140 (2012)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The total {k}-domatic number of digraphs. Discussiones Mathematicae Graph Theory 32(3): 461-471 (2012)

Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann: k-Domination and k-Independence in Graphs: A Survey. Graphs and Combinatorics 28(1): 1-55 (2012)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The total {k}-domatic number of a graph. J. Comb. Optim. 23(2): 252-260 (2012)

Lutz Volkmann: Bounds on the signed domatic number. Appl. Math. Lett. 24(2): 196-198 (2011)

Dirk Meierling, Seyed Mahmoud Sheikholeslami, Lutz Volkmann: Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph. Appl. Math. Lett. 24(10): 1758-1761 (2011)

Lutz Volkmann: Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. Ars Comb. 99: 55-64 (2011)

Adriana Hansberg, Lutz Volkmann: On 2-domination and independence domination numbers of graphs. Ars Comb. 101: 405-415 (2011)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: Signed star k-domatic number of a graph. Contributions to Discrete Mathematics 6(2) (2011)

Lutz Volkmann: Upper bounds on the signed total domatic number of graphs. Discrete Applied Mathematics 159(8): 832-837 (2011)

E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann: Unique response Roman domination in graphs. Discrete Applied Mathematics 159(11): 1110-1117 (2011)

Lutz Volkmann: Signed domination and signed domatic numbers of digraphs. Discussiones Mathematicae Graph Theory 31(3): 415-427 (2011)

Mustapha Chellali, Lutz Volkmann: Characterization of trees with equal 2-domination number and domination number plus two. Discussiones Mathematicae Graph Theory 31(4): 687-697 (2011)

Lutz Volkmann: Connected global offensive k-alliances in graphs. Discussiones Mathematicae Graph Theory 31(4): 699-707 (2011)

Nader Jafari Rad, Lutz Volkmann: Roman bondage in graphs. Discussiones Mathematicae Graph Theory 31(4): 763-773 (2011)

Nader Jafari Rad, Lutz Volkmann: On the Roman Bondage Number of Planar Graphs. Graphs and Combinatorics 27(4): 531-538 (2011)

Adriana Hansberg, Dirk Meierling, Lutz Volkmann: Independence and k-domination in graphs. Int. J. Comput. Math. 88(5): 905-915 (2011)

Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The Roman domatic number of a graph. Appl. Math. Lett. 23(10): 1295-1300 (2010)

Lutz Volkmann: Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. Ars Comb. 96 (2010)

Peter Dankelmann, Lutz Volkmann: The Diameter of Almost Eulerian Digraphs. Electr. J. Comb. 17(1) (2010)

M. Atapour, Seyed Mahmoud Sheikholeslami, A. N. Ghameshlou, Lutz Volkmann: Signed star domatic number of a graph. Discrete Applied Mathematics 158(3): 213-218 (2010)

Dirk Meierling, Lutz Volkmann: Cycle factors in strongly connected local tournaments. Discrete Mathematics 310(4): 850-860 (2010)

Adriana Hansberg, Lutz Volkmann: On the geodetic and geodetic domination numbers of a graph. Discrete Mathematics 310(15-16): 2140-2146 (2010)

Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann: k-independence stable graphs upon edge removal. Discussiones Mathematicae Graph Theory 30(2): 265-274 (2010)

Adriana Hansberg, Dirk Meierling, Lutz Volkmann: A general method in the theory of domination in graphs. Int. J. Comput. Math. 87(13): 2915-2924 (2010)

Andreas Holtkamp, Lutz Volkmann: On local connectivity of graphs with given clique number. Journal of Graph Theory 63(3): 192-197 (2010)

Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann: Proof of a conjecture on game domination. Journal of Graph Theory 64(4): 323-329 (2010)

Lutz Volkmann: Some remarks on the signed domatic number of graphs with small minimum degree. Appl. Math. Lett. 22(8): 1166-1169 (2009)

Adriana Hansberg, Lutz Volkmann: Upper bounds on the k-domination number and the k-Roman domination number. Discrete Applied Mathematics 157(7): 1634-1639 (2009)

Dirk Meierling, Lutz Volkmann, Stephan Zitzen: The signed domatic number of some regular graphs. Discrete Applied Mathematics 157(8): 1905-1912 (2009)

Lutz Volkmann, Stefan Winzen: Every cycle-connected multipartite tournament has a universal arc. Discrete Mathematics 309(4): 1013-1017 (2009)

Dieter Rautenbach, Lutz Volkmann: On the existence of edge cuts leaving several large components. Discrete Mathematics 309(6): 1703-1707 (2009)

Dirk Meierling, Lutz Volkmann: On the number of cycles in local tournaments. Discrete Mathematics 309(8): 2042-2052 (2009)

Terry A. McKee, Lutz Volkmann: Parity and disparity subgraphs. Discrete Mathematics 309(8): 2608-2612 (2009)

Peter Dankelmann, Angelika Hellwig, Lutz Volkmann: Inverse degree and edge-connectivity. Discrete Mathematics 309(9): 2943-2947 (2009)

Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen: Complementary cycles in regular multipartite tournaments, where one cycle has length five. Discrete Mathematics 309(10): 3131-3149 (2009)

Andreas Holtkamp, Lutz Volkmann: On the connectivity of p-diamond-free graphs. Discrete Mathematics 309(20): 6065-6069 (2009)

Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann: Bounds on the global offensive k-alliance number in graphs. Discussiones Mathematicae Graph Theory 29(3): 597-613 (2009)

Peter Dankelmann, Lutz Volkmann: Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009)

Dirk Meierling, Lutz Volkmann: A remark on degree sequences of multigraphs. Math. Meth. of OR 69(2): 369-374 (2009)

Lutz Volkmann: On local connectivity of graphs. Appl. Math. Lett. 21(1): 63-66 (2008)

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)

Angelika Hellwig, Lutz Volkmann: The connectivity of a graph and its complement. Discrete Applied Mathematics 156(17): 3325-3328 (2008)

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)

Dirk Meierling, Lutz Volkmann: All 2-connected in-tournaments that are cycle complementary. Discrete Mathematics 308(11): 2115-2133 (2008)

Adriana Hansberg, Lutz Volkmann: On graphs with equal domination and 2-domination numbers. Discrete Mathematics 308(11): 2277-2281 (2008)

F. Dahme, Dieter Rautenbach, Lutz Volkmann: alpha-Domination perfect trees. Discrete Mathematics 308(15): 3187-3198 (2008)

Angelika Hellwig, Lutz Volkmann: Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Discrete Mathematics 308(15): 3265-3296 (2008)

Lutz Volkmann, Stefan Winzen: Strong subtournaments containing a given vertex in regular multipartite tournaments. Discrete Mathematics 308(23): 5516-5521 (2008)

Dieter Rautenbach, Lutz Volkmann: Some remarks on lambda_{p, q}-connectedness. Discrete Mathematics 308(23): 5562-5569 (2008)

Dirk Meierling, Lutz Volkmann: On arc-traceable local tournaments. Discrete Mathematics 308(24): 6513-6526 (2008)

Torsten Korneffel, Dirk Meierling, Lutz Volkmann: A remark on the (2, 2)-domination number. Discussiones Mathematicae Graph Theory 28(2): 361-366 (2008)

Odile Favaron, Adriana Hansberg, Lutz Volkmann: On k-domination and minimum degree in graphs. Journal of Graph Theory 57(1): 33-40 (2008)

Dieter Rautenbach, Lutz Volkmann: Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008)

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)

Lutz Volkmann: A remark on cycles through an arc in strongly connected multipartite tournaments. Appl. Math. Lett. 20(11): 1148-1150 (2007)

Peter Dankelmann, Lutz Volkmann: Average distance in bipartite tournaments. Ars Comb. 83 (2007)

Sabine Klinkenberg, Lutz Volkmann: On the order of close to regular graphs without a matching of given size. Ars Comb. 85 (2007)

Adriana Hansberg, Dirk Meierling, Lutz Volkmann: Distance Domination and Distance Irredundance in Graphs. Electr. J. Comb. 14(1) (2007)

Lutz Volkmann: A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. Electr. J. Comb. 14(1) (2007)

Peter Dankelmann, Angelika Hellwig, Lutz Volkmann: On the connectivity of diamond-free graphs. Discrete Applied Mathematics 155(16): 2111-2117 (2007)

Lutz Volkmann: Multipartite tournaments: A survey. Discrete Mathematics 307(24): 3097-3129 (2007)

Lutz Volkmann: Local-edge-connectivity in digraphs and oriented graphs. Discrete Mathematics 307(24): 3207-3212 (2007)

Irene Stella, Lutz Volkmann, Stefan Winzen: Strongly 4-path-connectivity in almost regular multipartite tournaments. Discrete Mathematics 307(24): 3213-3219 (2007)

Adriana Hansberg Pastor, Lutz Volkmann: Characterization of block graphs with equal 2-domination number and domination number plus one. Discussiones Mathematicae Graph Theory 27(1): 93-103 (2007)

Lutz Volkmann: Restricted arc-connectivity of digraphs. Inf. Process. Lett. 103(6): 234-239 (2007)

Lutz Volkmann: Degree sequence conditions for maximally edge-connected oriented graphs. Appl. Math. Lett. 19(11): 1255-1260 (2006)

Lutz Volkmann: Upper bounds on the domination number of a graph in terms of order and minimum degree. Ars Comb. 81 (2006)

Lutz Volkmann, Stefan Winzen: On the connectivity of close to regular multipartite tournaments. Discrete Applied Mathematics 154(9): 1437-1452 (2006)

Lutz Volkmann: On cycles in regular 3-partite tournaments. Discrete Mathematics 306(12): 1198-1206 (2006)

Mostafa Blidia, Mustapha Chellali, Lutz Volkmann: Some bounds on the p-domination number in trees. Discrete Mathematics 306(17): 2031-2037 (2006)

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)

Lutz Volkmann: Longest cycles in almost regular 3-partite tournaments. Discrete Mathematics 306(22): 2931-2942 (2006)

Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann: Extremal bipartite graphs with a unique k-factor. Discussiones Mathematicae Graph Theory 26(2): 181-192 (2006)

Michael Poschen, Lutz Volkmann: A lower bound for the irredundance number of trees. Discussiones Mathematicae Graph Theory 26(2): 209-215 (2006)

Angelika Hellwig, Lutz Volkmann: Lower bounds on the vertex-connectivity of digraphs and graphs. Inf. Process. Lett. 99(2): 41-46 (2006)

Paul L. Butzer, Lutz Volkmann: Otto Blumenthal (1876-1944) in retrospect. Journal of Approximation Theory 138(1): 1-36 (2006)

Angelika Hellwig, Lutz Volkmann: On connectivity in graphs with given clique number. Journal of Graph Theory 52(1): 7-14 (2006)

Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Extremal Trees with Respect to Dominance Order. Ars Comb. 76 (2005)

Peter Dankelmann, Lutz Volkmann: Average distance in k-connected tournaments. Ars Comb. 77 (2005)

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)

Lutz Volkmann, Bohdan Zelinka: Signed domatic number of a graph. Discrete Applied Mathematics 150(1-3): 261-267 (2005)

Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Cuts leaving components of given minimum order. Discrete Mathematics 292(1-3): 55-65 (2005)

Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich: Unique irredundance, domination and independent domination in graphs. Discrete Mathematics 305(1-3): 190-200 (2005)

Mostafa Blidia, Mustapha Chellali, Lutz Volkmann: On the p-domination number of cactus graphs. Discussiones Mathematicae Graph Theory 25(3): 355-361 (2005)

Arne Hoffmann, Lutz Volkmann: Structural Remarks on Bipartite Graphs with Unique f-Factors. Graphs and Combinatorics 21(4): 421-425 (2005)

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)

Angelika Hellwig, Lutz Volkmann: Maximally local-edge-connected graphs and digraphs. Ars Comb. 72 (2004)

Lutz Volkmann: The Maximum Size Of Graphs With A Unique k- Factor. Combinatorica 24(3): 531-540 (2004)

Arne Hoffmann, Lutz Volkmann: On Regular Factors in Regular Graphs with Small Radius. Electr. J. Comb. 11(1) (2004)

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)

Arne Hoffmann, Lutz Volkmann: On unique k-factors and unique [1, k]-factors in graphs. Discrete Mathematics 278(1-3): 127-138 (2004)

Lutz Volkmann: All regular multipartite tournaments that are cycle complementary. Discrete Mathematics 281(1-3): 255-266 (2004)

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)

Angelika Hellwig, Lutz Volkmann: Sufficient conditions for lambda'-optimality in graphs of diameter 2. Discrete Mathematics 283(1-3): 113-120 (2004)

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)

Christian Peters, Lutz Volkmann: Vertex 6-pancyclic in-tournaments. Discrete Mathematics 285(1-3): 227-238 (2004)

Lutz Volkmann, Stefan Winzen: Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. Discrete Mathematics 285(1-3): 267-278 (2004)

Lutz Volkmann: Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. Discrete Mathematics 285(1-3): 359-364 (2004)

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)

F. Dahme, Dieter Rautenbach, Lutz Volkmann: Some remarks on alpha-domination. Discussiones Mathematicae Graph Theory 24(3): 423-430 (2004)

Yubao Guo, Lutz Volkmann: Extendable Cycles in Multipartite Tournaments. Graphs and Combinatorics 20(2): 185-190 (2004)

Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann: Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004)

Nicola Ueffing, Lutz Volkmann: Restricted edge-connectivity and minimum edge-degree. Ars Comb. 66 (2003)

Lutz Volkmann: Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Comb. 67 (2003)

Lutz Volkmann: Cycles of length four through a given arc in almost regular multipartite tournaments. Ars Comb. 68 (2003)

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)

Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Remarks on the bondage number of planar graphs. Discrete Mathematics 260(1-3): 57-67 (2003)

Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann: Maximum graphs with a unique minimum dominating set. Discrete Mathematics 260(1-3): 197-203 (2003)

Dieter Rautenbach, Lutz Volkmann: Extremal subgraphs with respect to vertex degree bounds. Discrete Mathematics 263(1-3): 297-303 (2003)

Dieter Rautenbach, Lutz Volkmann: On alpha_rgamma_s(k)-perfect graphs. Discrete Mathematics 270(1-3): 240-249 (2003)

Lutz Volkmann: Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. Journal of Graph Theory 42(3): 234-245 (2003)

Miranca Fischermann, Lutz Volkmann: Graphs having distance-n domination number half their order. Discrete Applied Mathematics 120(1-3): 97-107 (2002)

Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann: Vertex pancyclic graphs. Discrete Applied Mathematics 120(1-3): 219-237 (2002)

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)

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)

Lutz Volkmann: Cycles in multipartite tournaments: results and problems. Discrete Mathematics 245(1-3): 19-53 (2002)

Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Weighted domination in triangle-free graphs. Discrete Mathematics 250(1-3): 233-239 (2002)

Lutz Volkmann, Vadim E. Zverovich: A disproof of Henning's conjecture on irredundance perfect graphs. Discrete Mathematics 254(1-3): 539-554 (2002)

Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann: Edge-cuts leaving components of order at least three. Discrete Mathematics 256(1-2): 431-439 (2002)

Lutz Volkmann: Longest paths through an arc in strong semicomplete multipartite digraphs. Discrete Mathematics 258(1-3): 331-337 (2002)

Dieter Rautenbach, Lutz Volkmann: Independent domination and matchings in graphs. Discrete Mathematics 259(1-3): 325-330 (2002)

Dieter Rautenbach, Lutz Volkmann: How local irregularity gets global in a graph. Journal of Graph Theory 41(1): 18-23 (2002)

Lutz Volkmann, Vadim E. Zverovich: Proof of a conjecture on irredundance perfect graphs. Journal of Graph Theory 41(4): 292-306 (2002)

Lutz Volkmann: Spanning multipartite tournaments of semicomplete multipartite digraphs. Ars Comb. 58 (2001)

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)

Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann: i gamma(1)-perfect graphs. Discrete Mathematics 234(1-3): 133-138 (2001)

Meike Tewes, Lutz Volkmann: Vertex pancyclic in-tournaments. Journal of Graph Theory 36(2): 84-104 (2001)

Peter Dankelmann, Lutz Volkmann: Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Mathematics 211: 217-223 (2000)

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)

Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann: A characterization of rho alpha(k)-perfect graphs. Discrete Mathematics 224(1-3): 265-271 (2000)

Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Some results on graph parameters in weighted graphs. Electronic Notes in Discrete Mathematics 5: 85-88 (2000)

Miranca Fischermann, Lutz Volkmann: Graphs with unique dominating sets. Electronic Notes in Discrete Mathematics 5: 123-125 (2000)

Meike Tewes, Lutz Volkmann: Vertex deletion and cycles in multipartite tournaments. Discrete Mathematics 197-198: 769-779 (1999)

Miranca Fischermann, Lutz Volkmann: Graphs having distance-n domination number half their order. Electronic Notes in Discrete Mathematics 3: 51-54 (1999)

Arne Hoffmann, Bert Randerath, Lutz Volkmann: Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electronic Notes in Discrete Mathematics 3: 82-85 (1999)

Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes: Vertex Pancyclic Graphs. Electronic Notes in Discrete Mathematics 3: 166-170 (1999)

Lutz Volkmann: The ratio of the irredundance and domination number of a graph. Discrete Mathematics 178(1-3): 221-228 (1998)

Dieter Rautenbach, Lutz Volkmann: The domatic number of block-cactus graphs. Discrete Mathematics 187(1-3): 185-193 (1998)

Bert Randerath, Lutz Volkmann: Characterization of graphs with equal domination and covering number. Discrete Mathematics 191(1-3): 159-169 (1998)

Bert Randerath, Lutz Volkmann: Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46 (1997)

Yubao Guo, Lutz Volkmann: Bypaths in Tournaments. Discrete Applied Mathematics 79(1-3): 127-135 (1997)

Yubao Guo, Axel Pinkernell, Lutz Volkmann: On cycles through a given vertex in multipartite tournaments. Discrete Mathematics 164(1-3): 165-170 (1997)

Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann: A classification of locally semicomplete digraphs. Discrete Mathematics 167-168: 101-114 (1997)

Peter Dankelmann, Lutz Volkmann: Degree sequence conditions for maximally edge-connected graphs and digraphs. Journal of Graph Theory 26(1): 27-34 (1997)

Lutz Volkmann: Fundamente der Graphentheorie. Springer Lehrbuch Mathematik, Springer 1996, isbn 978-3-211-82774-1, pp. I-XIX, 1-445

Ursala Lenkewitz, Lutz Volkmann: Neighbourhood and degree conditions for the existence of regular factors. Ars Comb. 42 (1996)

Peter Maschlanka, Lutz Volkmann: Independence number in n-extendable graphs. Discrete Mathematics 154(1-3): 167-178 (1996)

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)

Yubao Guo, Lutz Volkmann: Locally semicomplete digraphs that are complementary m-pancyclic. Journal of Graph Theory 21(2): 121-136 (1996)

Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann: Weakly Hamiltonian-connected locally semicomplete digraphs. Journal of Graph Theory 21(2): 163-172 (1996)

Yubao Guo, Lutz Volkmann: A generalization of menger's theorem for certain block - cactus graphs. Graphs and Combinatorics 11(1): 49-52 (1995)

Lutz Volkmann: on Graphs with Equal Domination and Covering Numbers. Discrete Applied Mathematics 51(1-2): 211-217 (1994)

Werner Siemes, Jerzy Topp, Lutz Volkmann: On unique independent sets in graphs. Discrete Mathematics 131(1-3): 279-285 (1994)

Yubao Guo, Lutz Volkmann: On complementary cycles in locally semicomplete digraphs. Discrete Mathematics 135(1-3): 121-127 (1994)

Yubao Guo, Lutz Volkmann: Cycles in Multipartite Tournaments. J. Comb. Theory, Ser. B 62(2): 363-366 (1994)

Yubao Guo, Lutz Volkmann: Connectivity properties of locally semicomplete digraphs. Journal of Graph Theory 18(3): 269-280 (1994)

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)

Christoph Stracke, Lutz Volkmann: A new domination conception. Journal of Graph Theory 17(3): 315-323 (1993)

Jerzy Topp, Lutz Volkmann: Sufficient conditions for equality of connectivity and minimum degree of a graph. Journal of Graph Theory 17(6): 695-700 (1993)

Jerzy Topp, Lutz Volkmann: On graphs with equal domination and independent domination numbers. Discrete Mathematics 96(1): 75-80 (1991)

Jerzy Topp, Lutz Volkmann: On packing and covering numbers of graphs. Discrete Mathematics 96(3): 229-238 (1991)

Peter Flach, Lutz Volkmann: Estimations for the domination number of a graph. Discrete Mathematics 80(2): 145-151 (1990)

Thomas Niessen, Lutz Volkmann: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. Journal of Graph Theory 14(2): 225-246 (1990)

Lutz Volkmann: Edge-connectivity in p-partite graphs. Journal of Graph Theory 13(1): 1-6 (1989)