Edge-connectivity in p-partite graphs. - Lutz Volkmann (J. Graph Theory, 1989)

Estimations for the domination number of a graph. - Peter Flach; Lutz Volkmann (Discret. Math., 1990)

Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. - Thomas Niessen; Lutz Volkmann (J. Graph Theory, 1990)

On graphs with equal domination and independent domination numbers. - Jerzy Topp; Lutz Volkmann (Discret. Math., 1991)

On packing and covering numbers of graphs. - Jerzy Topp; Lutz Volkmann (Discret. Math., 1991)

Some upper bounds for the product of the domination number and the chromatic number of a graph. - Jerzy Topp; Lutz Volkmann (Discret. Math., 1993)

A new domination conception. - Christoph Stracke; Lutz Volkmann (J. Graph Theory, 1993)

Sufficient conditions for equality of connectivity and minimum degree of a graph. - Jerzy Topp; Lutz Volkmann (J. Graph Theory, 1993)

A characterization of well covered block-cactus graphs. - Bert Randerath; Lutz Volkmann (Australas. J Comb., 1994)

on Graphs with Equal Domination and Covering Numbers. - Lutz Volkmann (Discret. Appl. Math., 1994)

On complementary cycles in locally semicomplete digraphs. - Yubao Guo; Lutz Volkmann (Discret. Math., 1994)

On unique independent sets in graphs. - Werner Siemes; Jerzy Topp; Lutz Volkmann (Discret. Math., 1994)

Cycles in Multipartite Tournaments. - Yubao Guo; Lutz Volkmann (J. Comb. Theory B, 1994)

Connectivity properties of locally semicomplete digraphs. - Yubao Guo; Lutz Volkmann (J. Graph Theory, 1994)

Tree-Ramsey numbers. - Yabao Guo; Lutz Volkmann (Australas. J Comb., 1995)

New sufficient conditions for equality of minimum degree and edge-connectivity. - Peter Dankelmann; Lutz Volkmann (Ars Comb., 1995)

On graphs with equal domination and edge independence numbers. - Lutz Volkmann (Ars Comb., 1995)

A generalization of menger's theorem for certain block - cactus graphs. - Yubao Guo; Lutz Volkmann (Graphs Comb., 1995)

Fundamente der Graphentheorie. - Lutz Volkmann (Springer, 1996)

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

Independence number in n-extendable graphs. - Peter Maschlanka; Lutz Volkmann (Discret. Math., 1996)

A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments. - Yubao Guo; Lutz Volkmann (J. Comb. Theory B, 1996)

Weakly Hamiltonian-connected locally semicomplete digraphs. - Jørgen Bang-Jensen; Yubao Guo; Lutz Volkmann (J. Graph Theory, 1996)

Locally semicomplete digraphs that are complementary m-pancyclic. - Yubao Guo; Lutz Volkmann (J. Graph Theory, 1996)

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

Bypaths in Tournaments. - Yubao Guo; Lutz Volkmann (Discret. Appl. Math., 1997)

A classification of locally semicomplete digraphs. - Jørgen Bang-Jensen; Yubao Guo; Gregory Z. Gutin; Lutz Volkmann (Discret. Math., 1997)

On cycles through a given vertex in multipartite tournaments. - Yubao Guo; Axel Pinkernell; Lutz Volkmann (Discret. Math., 1997)

Degree sequence conditions for maximally edge-connected graphs and digraphs. - Peter Dankelmann; Lutz Volkmann (J. Graph Theory, 1997)

Some structural results on linear arboricity. - Dieter Rautenbach; Lutz Volkmann (Australas. J Comb., 1998)

On the cycle structure of in-tournaments. - Meike Tewes; Lutz Volkmann (Australas. J Comb., 1998)

Characterization of graphs with equal domination and covering number. - Bert Randerath; Lutz Volkmann (Discret. Math., 1998)

The domatic number of block-cactus graphs. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 1998)

The ratio of the irredundance and domination number of a graph. - Lutz Volkmann (Discret. Math., 1998)

Strong subtournaments of multipartite tournaments. - Lutz Volkmann (Australas. J Comb., 1999)

Vertex deletion and cycles in multipartite tournaments. - Meike Tewes; Lutz Volkmann (Discret. Math., 1999)

Longest paths in semicomplete multipartite digraphs. - Lutz Volkmann (Discret. Math., 1999)

Maximal Sets of 2-Factors in Complete Equipartite Graphs. - Arne Hoffmann; Bert Randerath; Lutz Volkmann (Electron. Notes Discret. Math., 1999)

Longest paths through an arc in strongly connected in-tournaments. - Lutz Volkmann (Australas. J Comb., 2000)

Degree sequence conditions for maximally edge-connected graphs depending on the clique number. - Peter Dankelmann; Lutz Volkmann (Discret. Math., 2000)

A characterization of rho alpha(k)-perfect graphs. - Lothar Dohmen; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2000)

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. - Yubao Guo; Meike Tewes; Lutz Volkmann; Anders Yeo (Discret. Math., 2000)

Some results on graph parameters in weighted graphs. - Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann (Electron. Notes Discret. Math., 2000)

Graphs with unique dominating sets. - Miranca Fischermann; Lutz Volkmann (Electron. Notes Discret. Math., 2000)

Spanning multipartite tournaments of semicomplete multipartite digraphs. - Lutz Volkmann (Ars Comb., 2001)

i gamma(1)-perfect graphs. - Lothar Dohmen; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2001)

The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. - Meike Tewes; Lutz Volkmann (Discret. Math., 2001)

Vertex pancyclic in-tournaments. - Meike Tewes; Lutz Volkmann (J. Graph Theory, 2001)

Unique minimum domination in trees. - Miranca Fischermann; Lutz Volkmann (Australas. J Comb., 2002)

Cycles through a given arc in certain almost regular multipartite tournaments. - Lutz Volkmann (Australas. J Comb., 2002)

Wiener index versus maximum degree in trees. - Miranca Fischermann; Arne Hoffmann; Dieter Rautenbach; László A. Székely; Lutz Volkmann (Discret. Appl. Math., 2002)

Graphs having distance-n domination number half their order. - Miranca Fischermann; Lutz Volkmann (Discret. Appl. Math., 2002)

Vertex pancyclic graphs. - Bert Randerath; Ingo Schiermeyer; Meike Tewes; Lutz Volkmann (Discret. Appl. Math., 2002)

Edge-cuts leaving components of order at least three. - Paul S. Bonsma; Nicola Ueffing; Lutz Volkmann (Discret. Math., 2002)

Weighted domination in triangle-free graphs. - Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2002)

Independent domination and matchings in graphs. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2002)

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. - Meike Tewes; Lutz Volkmann; Anders Yeo (Discret. Math., 2002)

Longest paths through an arc in strong semicomplete multipartite digraphs. - Lutz Volkmann (Discret. Math., 2002)

Cycles in multipartite tournaments: results and problems. - Lutz Volkmann (Discret. Math., 2002)

A disproof of Henning's conjecture on irredundance perfect graphs. - Lutz Volkmann; Vadim E. Zverovich (Discret. Math., 2002)

How local irregularity gets global in a graph. - Dieter Rautenbach; Lutz Volkmann (J. Graph Theory, 2002)

Proof of a conjecture on irredundance perfect graphs. - Lutz Volkmann; Vadim E. Zverovich (J. Graph Theory, 2002)

Minimum degree conditions for the Overfull Conjecture for odd order graphs. - Kerstin Bongard; Arne Hoffmann; Lutz Volkmann (Australas. J Comb., 2003)

Maximally edge-connected digraphs. - Angelika Hellwig; Lutz Volkmann (Australas. J Comb., 2003)

Cycles through a given arc in almost regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2003)

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

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

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

A Linear-programming Approach to the Generalized Randic Index. - Miranca Fischermann; Arne Hoffmann; Dieter Rautenbach; Lutz Volkmann (Discret. Appl. Math., 2003)

Remarks on the bondage number of planar graphs. - Miranca Fischermann; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2003)

Maximum graphs with a unique minimum dominating set. - Miranca Fischermann; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2003)

On alphargammas(k)-perfect graphs. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2003)

Extremal subgraphs with respect to vertex degree bounds. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2003)

Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. - Lutz Volkmann (J. Graph Theory, 2003)

On the size of odd order graphs with no almost perfect matching. - Lutz Volkmann (Australas. J Comb., 2004)

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

The Maximum Size Of Graphs With A Unique k- Factor. - Lutz Volkmann (Comb., 2004)

On Regular Factors in Regular Graphs with Small Radius. - Arne Hoffmann; Lutz Volkmann (Electron. J. Comb., 2004)

Relations between the lower domination parameters and the chromatic number of a graph. - Mustapha Chellali; Lutz Volkmann (Discret. Math., 2004)

Sufficient conditions for lambda'-optimality in graphs of diameter 2. - Angelika Hellwig; Lutz Volkmann (Discret. Math., 2004)

On unique k-factors and unique [1, k]-factors in graphs. - Arne Hoffmann; Lutz Volkmann (Discret. Math., 2004)

Vertex 6-pancyclic in-tournaments. - Christian Peters; Lutz Volkmann (Discret. Math., 2004)

All regular multipartite tournaments that are cycle complementary. - Lutz Volkmann (Discret. Math., 2004)

Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. - Lutz Volkmann (Discret. Math., 2004)

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]. - Lutz Volkmann (Discret. Math., 2004)

Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2004)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2004)

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. - Lutz Volkmann; Anders Yeo (Discret. Math., 2004)

Some remarks on alpha-domination. - F. Dahme; Dieter Rautenbach; Lutz Volkmann (Discuss. Math. Graph Theory, 2004)

Extendable Cycles in Multipartite Tournaments. - Yubao Guo; Lutz Volkmann (Graphs Comb., 2004)

Note on the connectivity of line graphs. - Angelika Hellwig; Dieter Rautenbach; Lutz Volkmann (Inf. Process. Lett., 2004)

Neighborhood conditions for graphs and digraphs to be maximally edge-connected. - Angelika Hellwig; Lutz Volkmann (Australas. J Comb., 2005)

Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c. - Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2005)

Complementary cycles in regular multipartite tournaments. - Lutz Volkmann (Australas. J Comb., 2005)

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

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

A note on the number of matchings and independent sets in trees. - Miranca Fischermann; Lutz Volkmann; Dieter Rautenbach (Discret. Appl. Math., 2005)

Signed domatic number of a graph. - Lutz Volkmann; Bohdan Zelinka (Discret. Appl. Math., 2005)

Unique irredundance, domination and independent domination in graphs. - Miranca Fischermann; Lutz Volkmann; Igor E. Zverovich (Discret. Math., 2005)

Cuts leaving components of given minimum order. - Angelika Hellwig; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2005)

On the p-domination number of cactus graphs. - Mostafa Blidia; Mustapha Chellali; Lutz Volkmann (Discuss. Math. Graph Theory, 2005)

Structural Remarks on Bipartite Graphs with Unique f-Factors. - Arne Hoffmann; Lutz Volkmann (Graphs Comb., 2005)

Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. - Angelika Hellwig; Lutz Volkmann (J. Graph Theory, 2005)

On the order of almost regular graphs without a matching of given size. - Sabine Klinkenberg; Lutz Volkmann (Australas. J Comb., 2006)

Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree. - Beate Küpper; Lutz Volkmann (Australas. J Comb., 2006)

Degree sequence conditions for maximally edge-connected oriented graphs. - Lutz Volkmann (Appl. Math. Lett., 2006)

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

On the connectivity of close to regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Appl. Math., 2006)

Some bounds on the p-domination number in trees. - Mostafa Blidia; Mustapha Chellali; Lutz Volkmann (Discret. Math., 2006)

On cycles in regular 3-partite tournaments. - Lutz Volkmann (Discret. Math., 2006)

Longest cycles in almost regular 3-partite tournaments. - Lutz Volkmann (Discret. Math., 2006)

Paths with a given number of vertices from each partite set in regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2006)

Extremal bipartite graphs with a unique k-factor. - Arne Hoffmann; Elzbieta Sidorowicz; Lutz Volkmann (Discuss. Math. Graph Theory, 2006)

A lower bound for the irredundance number of trees. - Michael Poschen; Lutz Volkmann (Discuss. Math. Graph Theory, 2006)

Lower bounds on the vertex-connectivity of digraphs and graphs. - Angelika Hellwig; Lutz Volkmann (Inf. Process. Lett., 2006)

Otto Blumenthal (1876-1944) in retrospect. - Paul L. Butzer; Lutz Volkmann (J. Approx. Theory, 2006)

On connectivity in graphs with given clique number. - Angelika Hellwig; Lutz Volkmann (J. Graph Theory, 2006)

Total and connected domination in digraphs. - S. Arumugam 001; K. Jacob; Lutz Volkmann (Australas. J Comb., 2007)

On the number of nonseparating vertices in strongly connected local tournaments. - Dirk Meierling; Lutz Volkmann (Australas. J Comb., 2007)

New bounds on the k-domination number and the k-tuple domination number. - Dieter Rautenbach; Lutz Volkmann (Appl. Math. Lett., 2007)

A remark on cycles through an arc in strongly connected multipartite tournaments. - Lutz Volkmann (Appl. Math. Lett., 2007)

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

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

Distance Domination and Distance Irredundance in Graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Electron. J. Comb., 2007)

A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. - Lutz Volkmann (Electron. J. Comb., 2007)

On the connectivity of diamond-free graphs. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Appl. Math., 2007)

Strongly 4-path-connectivity in almost regular multipartite tournaments. - Irene Stella; Lutz Volkmann; Stefan Winzen (Discret. Math., 2007)

Multipartite tournaments: A survey. - Lutz Volkmann (Discret. Math., 2007)

Local-edge-connectivity in digraphs and oriented graphs. - Lutz Volkmann (Discret. Math., 2007)

Characterization of block graphs with equal 2-domination number and domination number plus one. - Adriana Hansberg Pastor; Lutz Volkmann (Discuss. Math. Graph Theory, 2007)

Restricted arc-connectivity of digraphs. - Lutz Volkmann (Inf. Process. Lett., 2007)

A note on the 2-domination number of a tree. - Jun Fujisawa; Adriana Hansberg; Takahiro Kubo; Akira Saito; Masahide Sugita; Lutz Volkmann (Australas. J Comb., 2008)

Restricted arc-connectivity of generalized tournaments. - Dirk Meierling; Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2008)

A characterization of bipartite graphs with independence number half their order. - Lutz Volkmann (Australas. J Comb., 2008)

On the order of almost regular bipartite graphs without perfect matchings. - Lutz Volkmann; Axel Zingsem (Australas. J Comb., 2008)

On local connectivity of graphs. - Lutz Volkmann (Appl. Math. Lett., 2008)

How close to regular must a multipartite tournament be to secure a given path covering number? - Irene Stella; Lutz Volkmann; Stefan Winzen (Ars Comb., 2008)

The connectivity of a graph and its complement. - Angelika Hellwig; Lutz Volkmann (Discret. Appl. Math., 2008)

alpha-Domination perfect trees. - F. Dahme; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2008)

On graphs with equal domination and 2-domination numbers. - Adriana Hansberg; Lutz Volkmann (Discret. Math., 2008)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey. - Angelika Hellwig; Lutz Volkmann (Discret. Math., 2008)

All 2-connected in-tournaments that are cycle complementary. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2008)

On arc-traceable local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2008)

Some remarks on lambdap, q-connectedness. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2008)

Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2008)

Strong subtournaments containing a given vertex in regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2008)

A remark on the (2, 2)-domination number. - Torsten Korneffel; Dirk Meierling; Lutz Volkmann (Discuss. Math. Graph Theory, 2008)

On k-domination and minimum degree in graphs. - Odile Favaron; Adriana Hansberg; Lutz Volkmann (J. Graph Theory, 2008)

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

Global offensive alliance numbers in graphs with emphasis on trees. - Mustapha Chellali; Teresa W. Haynes; Lutz Volkmann (Australas. J Comb., 2009)

A characterization of even order trees with domination number half their order minus one. - Adriana Hansberg; Lutz Volkmann (Australas. J Comb., 2009)

On regular (1, q)-extendable graphs. - Lutz Volkmann (Australas. J Comb., 2009)

Some remarks on the signed domatic number of graphs with small minimum degree. - Lutz Volkmann (Appl. Math. Lett., 2009)

Upper bounds on the k-domination number and the k-Roman domination number. - Adriana Hansberg; Lutz Volkmann (Discret. Appl. Math., 2009)

The signed domatic number of some regular graphs. - Dirk Meierling; Lutz Volkmann; Stephan Zitzen (Discret. Appl. Math., 2009)

Inverse degree and edge-connectivity. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Math., 2009)

Complementary cycles in regular multipartite tournaments, where one cycle has length five. - Zhihong He; Torsten Korneffel; Dirk Meierling; Lutz Volkmann; Stefan Winzen (Discret. Math., 2009)

On the connectivity of p-diamond-free graphs. - Andreas Holtkamp; Lutz Volkmann (Discret. Math., 2009)

Parity and disparity subgraphs. - Terry A. McKee; Lutz Volkmann (Discret. Math., 2009)

On the number of cycles in local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2009)

On the existence of edge cuts leaving several large components. - Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2009)

Every cycle-connected multipartite tournament has a universal arc. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2009)

Bounds on the global offensive k-alliance number in graphs. - Mustapha Chellali; Teresa W. Haynes; Bert Randerath; Lutz Volkmann (Discuss. Math. Graph Theory, 2009)

Minimum size of a graph or digraph of given radius. - Peter Dankelmann; Lutz Volkmann (Inf. Process. Lett., 2009)

A remark on degree sequences of multigraphs. - Dirk Meierling; Lutz Volkmann (Math. Methods Oper. Res., 2009)

Independence and global offensive alliance in graphs. - Mustapha Chellali; Lutz Volkmann (Australas. J Comb., 2010)

On almost 1-extendable graphs. - Lutz Volkmann (Australas. J Comb., 2010)

The Roman domatic number of a graph. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Appl. Math. Lett., 2010)

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

The Diameter of Almost Eulerian Digraphs. - Peter Dankelmann; Lutz Volkmann (Electron. J. Comb., 2010)

Signed star domatic number of a graph. - M. Atapour; Seyed Mahmoud Sheikholeslami; Arezoo N. Ghameshlou; Lutz Volkmann (Discret. Appl. Math., 2010)

On the geodetic and geodetic domination numbers of a graph. - Adriana Hansberg; Lutz Volkmann (Discret. Math., 2010)

Cycle factors in strongly connected local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2010)

k-independence stable graphs upon edge removal. - Mustapha Chellali; Teresa W. Haynes; Lutz Volkmann (Discuss. Math. Graph Theory, 2010)

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

Proof of a conjecture on game domination. - Odile Favaron; Hossein Karami 002; R. Khoeilar; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (J. Graph Theory, 2010)

On local connectivity of graphs with given clique number. - Andreas Holtkamp; Lutz Volkmann (J. Graph Theory, 2010)

2-domination in bipartite graphs with odd independence number. - Adriana Hansberg; Lutz Volkmann (Australas. J Comb., 2011)

On local connectivity of K2, p-free graphs. - Andreas Holtkamp; Lutz Volkmann (Australas. J Comb., 2011)

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

Bounds on the signed domatic number. - Lutz Volkmann (Appl. Math. Lett., 2011)

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

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

Signed star k-domatic number of a graph. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Contributions Discret. Math., 2011)

Unique response Roman domination in graphs. - E. Ebrahimi Targhi; Nader Jafari Rad; Lutz Volkmann (Discret. Appl. Math., 2011)

Upper bounds on the signed total domatic number of graphs. - Lutz Volkmann (Discret. Appl. Math., 2011)

Characterization of trees with equal 2-domination number and domination number plus two. - Mustapha Chellali; Lutz Volkmann (Discuss. Math. Graph Theory, 2011)

Roman bondage in graphs. - Nader Jafari Rad; Lutz Volkmann (Discuss. Math. Graph Theory, 2011)

Signed domination and signed domatic numbers of digraphs. - Lutz Volkmann (Discuss. Math. Graph Theory, 2011)

Connected global offensive k-alliances in graphs. - Lutz Volkmann (Discuss. Math. Graph Theory, 2011)

On the Roman Bondage Number of Planar Graphs. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2011)

Independence and k-domination in graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Int. J. Comput. Math., 2011)

The smallest regular graphs which are not 1-extendable. - Lutz Volkmann (Ars Comb., 2012)

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

Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. - Dirk Meierling; Lutz Volkmann (Discret. Appl. Math., 2012)

Signed 2-independence in digraphs. - Lutz Volkmann (Discret. Math., 2012)

Signed total {k}-domination and {k}-Domatic numbers of Graphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Math. Algorithms Appl., 2012)

The k-rainbow domatic number of a graph. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2012)

The total {k}-domatic number of digraphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2012)

k-Domination and k-Independence in Graphs: A Survey. - Mustapha Chellali; Odile Favaron; Adriana Hansberg; Lutz Volkmann (Graphs Comb., 2012)

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

Signed total (j, k)-domatic numbers of graphs. - Lutz Volkmann (Australas. J Comb., 2013)

Smallest regular and almost regular triangle-free graphs without perfect matchings. - Lutz Volkmann (Ars Comb., 2013)

A note on the independent domination number in graphs. - Nader Jafari Rad; Lutz Volkmann (Discret. Appl. Math., 2013)

Complementary cycles in almost regular multipartite tournaments, where one cycle has length four. - Lutz Volkmann (Discret. Appl. Math., 2013)

The distance Roman domination numbers of graphs. - Hamideh Aram; S. Norouzian; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2013)

Bounds on the signed 2-independence number in graphs. - Lutz Volkmann (Discuss. Math. Graph Theory, 2013)

Roman Domination Dot-critical Graphs. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2013)

Bounds on the k-independence and k-chromatic numbers of graphs. - Mostafa Blidia; Ahmed Bouchou; Lutz Volkmann (Ars Comb., 2014)

The k-rainbow bondage number of a graph. - Nasrin Dehgardi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Appl. Math., 2014)

Signed k-domatic numbers of graphs. - Odile Favaron; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Ars Comb., 2015)

Signed Roman k-domination in trees. - Michael A. Henning; Lutz Volkmann (Discret. Appl. Math., 2015)

The signed Roman k-domatic number of a graph. - Lutz Volkmann (Discret. Appl. Math., 2015)

Signed star (j, k)-domatic numbers of digraphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Math. Algorithms Appl., 2015)

The k-rainbow bondage number of a digraph. - Jafar Amjadi; Negar Mohammadi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2015)

On the signed (total) k-independence number in graphs. - Abdollah Khodkar; Babak Samadi; Lutz Volkmann (Discuss. Math. Graph Theory, 2015)

Upper bounds on the signed total (k, k)-domatic number of graphs. - Lutz Volkmann (Discuss. Math. Graph Theory, 2015)

The signed Roman domatic number of a digraph. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Electron. J. Graph Theory Appl., 2015)

Global Roman Domination in Trees. - M. Atapour; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Graphs Comb., 2015)

Signed Roman domination in digraphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (J. Comb. Optim., 2015)

The signed Roman k-domatic number of digraphs. - Lutz Volkmann (Australas. J Comb., 2016)

Total restrained reinforcement in graphs. - Nader Jafari Rad; Lutz Volkmann (AKCE Int. J. Graphs Comb., 2016)

On the rainbow restrained domination number. - Hossein Abdollahzadeh Ahangar; Jafar Amjadi; Seyed Mahmoud Sheikholeslami; Vladimir Samodivkin; Lutz Volkmann (Ars Comb., 2016)

Rainbow restrained domination numbers in graphs. - Jafar Amjadi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Ars Comb., 2016)

Matchings in 4-total restrained domination vertex critical graphs. - Nader Jafari Rad; Lutz Volkmann (Ars Comb., 2016)

Signed (j, k)-domatic number of graphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Ars Comb., 2016)

On the signed total Roman domination and domatic numbers of graphs. - Lutz Volkmann (Discret. Appl. Math., 2016)

New bounds on the signed total domination number of graphs. - Seyyed Mehdi Hosseini Moghaddam; Doost Ali Mojdeh; Babak Samadi; Lutz Volkmann (Discuss. Math. Graph Theory, 2016)

Signed Roman k-Domination in Graphs. - Michael A. Henning; Lutz Volkmann (Graphs Comb., 2016)

Edge-Removal and Edge-Addition in α-Domination. - Nader Jafari Rad; Lutz Volkmann (Graphs Comb., 2016)

Signed Roman k-domination in Digraphs. - Lutz Volkmann (Graphs Comb., 2016)

Signed mixed Roman domination numbers in graphs. - Hossein Abdollahzadeh Ahangar; Leila Asgharsharghi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (J. Comb. Optim., 2016)

Signed Roman edge domination numbers in graphs. - Hossein Abdollahzadeh Ahangar; Jafar Amjadi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann; Yancai Zhao (J. Comb. Optim., 2016)

Signed total Roman domination in graphs. - Lutz Volkmann (J. Comb. Optim., 2016)

Generalization of the total outer-connected domination in graphs. - Nader Jafari Rad; Lutz Volkmann (RAIRO Oper. Res., 2016)

Lower bounds on the signed k-domination number of graphs. - Lutz Volkmann (Ars Comb., 2017)

The k-rainbow reinforcement numbers in graphs. - Jafar Amjadi; Leila Asgharsharghi; Nasrin Dehgardi; Michitaka Furuya; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Appl. Math., 2017)

Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. - Zhibing Chen; Guifu Su; Lutz Volkmann (Discret. Appl. Math., 2017)

Universal arcs in local tournaments. - Wei Meng; Jia Guo; Mei Lu; Yubao Guo; Lutz Volkmann (Discret. Math., 2017)

Signed Roman edge k-domination in graphs. - Leila Asgharsharghi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2017)

Signed total Roman domination in digraphs. - Lutz Volkmann (Discuss. Math. Graph Theory, 2017)

The signed total Roman k-domatic number of a graph. - Lutz Volkmann (Discuss. Math. Graph Theory, 2017)

On the signed 2-independence number of graphs. - S. M. Hosseini Moghaddam; Doost Ali Mojdeh; Babak Samadi; Lutz Volkmann (Electron. J. Graph Theory Appl., 2017)

Roman game domination number of a graph. - A. Bahremandpour; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (J. Comb. Optim., 2017)

An introduction to the twin signed total k-domination numbers in directed graphs. - Masoud Atapour; Nasrin Dehgardi; Lutz Volkmann (RAIRO Oper. Res., 2017)

Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number. - Sebastian Milz; Lutz Volkmann (Discret. Math., 2018)

An upper bound on the double Roman domination number. - Jafar Amjadi; Sakineh Nazari-Moghaddam; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (J. Comb. Optim., 2018)

Bounds on the fair total domination number in trees and unicyclic graphs. - Majid Hajian; Nader Jafari Rad; Lutz Volkmann (Australas. J Comb., 2019)

The Roman {2}-domatic number of graphs. - Lutz Volkmann (Discret. Appl. Math., 2019)

Bounds on the signed Roman k-domination number of a digraph. - Xiaodan Chen; Guoliang Hao; Lutz Volkmann (Discuss. Math. Graph Theory, 2019)

On the co-Roman domination in graphs. - Zehui Shao; Seyed Mahmoud Sheikholeslami; Marzieh Soroudi; Lutz Volkmann; Xinmiao Liu (Discuss. Math. Graph Theory, 2019)

Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number. - Lutz Volkmann (Discuss. Math. Graph Theory, 2019)

Varieties of Roman domination II. - Mustapha Chellali; Nader Jafari Rad; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (AKCE Int. J. Graphs Comb., 2020)

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs. - Doost Ali Mojdeh; Babak Samadi; Lutz Volkmann (Contributions Discret. Math., 2020)

A proof of a conjecture on the differential of a subcubic graph. - R. Khoeilar; Hossein Karami 002; Mustapha Chellali; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Appl. Math., 2020)

Roman {3}-domination (double Italian domination). - Doost Ali Mojdeh; Lutz Volkmann (Discret. Appl. Math., 2020)

Critical concept for double Roman domination in graphs. - Sakineh Nazari-Moghaddam; Lutz Volkmann (Discret. Math. Algorithms Appl., 2020)

The double Roman domatic number of a digraph. - Lutz Volkmann (Discuss. Math. Graph Theory, 2020)

Total Roman {3}-domination in Graphs. - Zehui Shao; Doost Ali Mojdeh; Lutz Volkmann (Symmetry, 2020)

Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected. - Zhen-Mu Hong; Zheng-Jiang Xia; Fu-Yuan Chen; Lutz Volkmann (Complex., 2021)

Domination, independent domination number and 2-independence number in trees. - Hamideh Aram; Nasrin Dehgardi; Seyed Mahmoud Sheikholeslami; Mina Valinavaz; Lutz Volkmann (Discuss. Math. Graph Theory, 2021)

Oriented diameter of maximal outerplanar graphs. - Xiaolin Wang; Yaojun Chen; Peter Dankelmann; Yubao Guo; Michel Surmacs; Lutz Volkmann (J. Graph Theory, 2021)

Nordhaus-Gaddum type results for connected and total domination. - Rana Khoeilar; Hossein Karami 002; Mustapha Chellali; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (RAIRO Oper. Res., 2021)

Restrained Roman and restrained Italian domatic numbers of graphs. - Lutz Volkmann (Discret. Appl. Math., 2022)

The Roman domatic problem in graphs and digraphs: a survey. - Mustapha Chellali; Nader Jafari Rad; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discuss. Math. Graph Theory, 2022)

Restrained double Roman domination of a graph. - Doost Ali Mojdeh; Iman Masoumi; Lutz Volkmann (RAIRO Oper. Res., 2022)

Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (RAIRO Oper. Res., 2022)

Total Italian domatic number of graphs. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Comput. Sci. J. Moldova, 2023)

Double Roman and double Italian domination. - Lutz Volkmann (Discuss. Math. Graph Theory, 2023)

Outer Independent Double Roman Domination Stability in Graphs. - Seyed Mahmoud Sheikholeslami; M. Esmaeili; Lutz Volkmann (Ars Comb., 2024)

Outer independent total double Italian domination number. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Comput. Sci. J. Moldova, 2024)

New bounds on the outer-independent total double Roman domination number. - Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Discret. Math. Algorithms Appl., 2024)

Signed total Roman domination and domatic numbers in graphs. - Yubao Guo; Lutz Volkmann; Yun Wang (Appl. Math. Comput., 2025)

The oriented diameter of graphs derived from other graphs. - Peter Dankelmann; Y. Guo; Emily Rivett-Carnac; Lutz Volkmann (Discret. Math., 2025)