Lutz Volkmann

276 papers Journal 275
YearRankTypeTitle / Venue / Authors
2025 J jnl
More results on the signed double Roman domination number of graphs.
AKCE Int. J. Graphs Comb.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2025 J jnl
Signed total Roman domination and domatic numbers in graphs.
Appl. Math. Comput.
Yubao Guo, Lutz Volkmann, Yun Wang
2025 J jnl
The oriented diameter of graphs derived from other graphs.
Discret. Math.
Peter Dankelmann, Y. Guo, Emily Rivett-Carnac, Lutz Volkmann
2024 J jnl
New bounds on the outer-independent total double Roman domination number.
Discret. Math. Algorithms Appl.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2024 J jnl
Outer Independent Double Roman Domination Stability in Graphs.
Ars Comb.
Seyed Mahmoud Sheikholeslami, M. Esmaeili, Lutz Volkmann
2024 J jnl
Outer independent total double Italian domination number.
Comput. Sci. J. Moldova
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2023 J jnl
Double Roman and double Italian domination.
Discuss. Math. Graph Theory
Lutz Volkmann
2023 J jnl
Total Italian domatic number of graphs.
Comput. Sci. J. Moldova
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2022 J jnl
Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs.
RAIRO Oper. Res.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2022 J jnl
Restrained Roman and restrained Italian domatic numbers of graphs.
Discret. Appl. Math.
Lutz Volkmann
2022 J jnl
Restrained double Roman domination of a graph.
RAIRO Oper. Res.
Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann
2022 J jnl
The Roman domatic problem in graphs and digraphs: a survey.
Discuss. Math. Graph Theory
Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2021 J jnl
Domination, independent domination number and 2-independence number in trees.
Discuss. Math. Graph Theory
Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann
2021 J jnl
Nordhaus-Gaddum type results for connected and total domination.
RAIRO Oper. Res.
Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2021 J jnl
Oriented diameter of maximal outerplanar graphs.
J. Graph Theory
Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann
2021 J jnl
Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected.
Complex.
Zhen-Mu Hong, Zheng-Jiang Xia, Fu-Yuan Chen, Lutz Volkmann
2020 J jnl
A proof of a conjecture on the differential of a subcubic graph.
Discret. Appl. Math.
R. Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2020 J jnl
Critical concept for double Roman domination in graphs.
Discret. Math. Algorithms Appl.
Sakineh Nazari-Moghaddam, Lutz Volkmann
2020 J jnl
Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs.
Contributions Discret. Math.
Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
2020 J jnl
Roman {3}-domination (double Italian domination).
Discret. Appl. Math.
Doost Ali Mojdeh, Lutz Volkmann
2020 J jnl
The double Roman domatic number of a digraph.
Discuss. Math. Graph Theory
Lutz Volkmann
2020 J jnl
Total Roman {3}-domination in Graphs.
Symmetry
Zehui Shao, Doost Ali Mojdeh, Lutz Volkmann
2020 J jnl
Varieties of Roman domination II.
AKCE Int. J. Graphs Comb.
Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2019 J jnl
Bounds on the fair total domination number in trees and unicyclic graphs.
Australas. J Comb.
Majid Hajian, Nader Jafari Rad, Lutz Volkmann
2019 J jnl
Bounds on the signed Roman
Discuss. Math. Graph Theory
Xiaodan Chen, Guoliang Hao, Lutz Volkmann
2019 J jnl
On the co-Roman domination in graphs.
Discuss. Math. Graph Theory
Zehui Shao, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi, Lutz Volkmann, Xinmiao Liu
2019 J jnl
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number.
Discuss. Math. Graph Theory
Lutz Volkmann
2019 J jnl
The Roman {2}-domatic number of graphs.
Discret. Appl. Math.
Lutz Volkmann
2018 J jnl
An upper bound on the double Roman domination number.
J. Comb. Optim.
Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2018 J jnl
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number.
Discret. Math.
Sebastian Milz, Lutz Volkmann
2017 J jnl
An introduction to the twin signed total
RAIRO Oper. Res.
Masoud Atapour, Nasrin Dehgardi, Lutz Volkmann
2017 J jnl
Lower bounds on the signed k-domination number of graphs.
Ars Comb.
Lutz Volkmann
2017 J jnl
On the signed 2-independence number of graphs.
Electron. J. Graph Theory Appl.
S. M. Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
2017 J jnl
Roman game domination number of a graph.
J. Comb. Optim.
A. Bahremandpour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2017 J jnl
Signed Roman edge
Discuss. Math. Graph Theory
Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2017 J jnl
Signed total Roman domination in digraphs.
Discuss. Math. Graph Theory
Lutz Volkmann
2017 J jnl
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs.
Discret. Appl. Math.
Zhibing Chen, Guifu Su, Lutz Volkmann
2017 J jnl
The k-rainbow reinforcement numbers in graphs.
Discret. Appl. Math.
Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2017 J jnl
The signed total Roman
Discuss. Math. Graph Theory
Lutz Volkmann
2017 J jnl
Universal arcs in local tournaments.
Discret. Math.
Wei Meng, Jia Guo, Mei Lu, Yubao Guo, Lutz Volkmann
2016 J jnl
Edge-Removal and Edge-Addition in α-Domination.
Graphs Comb.
Nader Jafari Rad, Lutz Volkmann
2016 J jnl
Generalization of the total outer-connected domination in graphs.
RAIRO Oper. Res.
Nader Jafari Rad, Lutz Volkmann
2016 J jnl
Matchings in 4-total restrained domination vertex critical graphs.
Ars Comb.
Nader Jafari Rad, Lutz Volkmann
2016 J jnl
New bounds on the signed total domination number of graphs.
Discuss. Math. Graph Theory
Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
2016 J jnl
On the rainbow restrained domination number.
Ars Comb.
Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Vladimir Samodivkin, Lutz Volkmann
2016 J jnl
On the signed total Roman domination and domatic numbers of graphs.
Discret. Appl. Math.
Lutz Volkmann
2016 J jnl
Rainbow restrained domination numbers in graphs.
Ars Comb.
Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2016 J jnl
Signed (j, k)-domatic number of graphs.
Ars Comb.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2016 J jnl
Signed Roman edge domination numbers in graphs.
J. Comb. Optim.
Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann, Yancai Zhao
2016 J jnl
Signed Roman k-Domination in Graphs.
Graphs Comb.
Michael A. Henning, Lutz Volkmann
2016 J jnl
Signed Roman k-domination in Digraphs.
Graphs Comb.
Lutz Volkmann
2016 J jnl
Signed mixed Roman domination numbers in graphs.
J. Comb. Optim.
Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2016 J jnl
Signed total Roman domination in graphs.
J. Comb. Optim.
Lutz Volkmann
2016 J jnl
The signed Roman k-domatic number of digraphs.
Australas. J Comb.
Lutz Volkmann
2016 J jnl
Total restrained reinforcement in graphs.
AKCE Int. J. Graphs Comb.
Nader Jafari Rad, Lutz Volkmann
2015 J jnl
Global Roman Domination in Trees.
Graphs Comb.
Maryam Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
On the signed (total)
Discuss. Math. Graph Theory
Abdollah Khodkar, Babak Samadi, Lutz Volkmann
2015 J jnl
Signed Roman domination in digraphs.
J. Comb. Optim.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
Signed Roman k-domination in trees.
Discret. Appl. Math.
Michael A. Henning, Lutz Volkmann
2015 J jnl
Signed k-domatic numbers of graphs.
Ars Comb.
Odile Favaron, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
Signed star (j, k)-domatic numbers of digraphs.
Discret. Math. Algorithms Appl.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
The
Discuss. Math. Graph Theory
Jafar Amjadi, Negar Mohammadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
The signed Roman domatic number of a digraph.
Electron. J. Graph Theory Appl.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2015 J jnl
The signed Roman k-domatic number of a graph.
Discret. Appl. Math.
Lutz Volkmann
2015 J jnl
Upper bounds on the signed total (
Discuss. Math. Graph Theory
Lutz Volkmann
2014 J jnl
Bounds on the k-independence and k-chromatic numbers of graphs.
Ars Comb.
Mostafa Blidia, Ahmed Bouchou, Lutz Volkmann
2014 J jnl
The k-rainbow bondage number of a graph.
Discret. Appl. Math.
Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2013 J jnl
A note on the independent domination number in graphs.
Discret. Appl. Math.
Nader Jafari Rad, Lutz Volkmann
2013 J jnl
Bounds on the signed 2-independence number in graphs.
Discuss. Math. Graph Theory
Lutz Volkmann
2013 J jnl
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four.
Discret. Appl. Math.
Lutz Volkmann
2013 J jnl
Roman Domination Dot-critical Graphs.
Graphs Comb.
Nader Jafari Rad, Lutz Volkmann
2013 J jnl
Signed total (j, k)-domatic numbers of graphs.
Australas. J Comb.
Lutz Volkmann
2013 J jnl
Smallest regular and almost regular triangle-free graphs without perfect matchings.
Ars Comb.
Lutz Volkmann
2013 J jnl
The distance Roman domination numbers of graphs.
Discuss. Math. Graph Theory
Hamideh Aram, S. Norouzian, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2012 J jnl
On regular (2, q)-extendable graphs.
Ars Comb.
Lutz Volkmann
2012 J jnl
Signed 2-independence in digraphs.
Discret. Math.
Lutz Volkmann
2012 J jnl
Signed total {k}-domination and {k}-Domatic numbers of Graphs.
Discret. Math. Algorithms Appl.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2012 J jnl
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected.
Discret. Appl. Math.
Dirk Meierling, Lutz Volkmann
2012 J jnl
The
Discuss. Math. Graph Theory
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2012 J jnl
The smallest regular graphs which are not 1-extendable.
Ars Comb.
Lutz Volkmann
2012 J jnl
The total {
Discuss. Math. Graph Theory
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2012 J jnl
The total {k}-domatic number of a graph.
J. Comb. Optim.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2012 J jnl
k-Domination and k-Independence in Graphs: A Survey.
Graphs Comb.
Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann
2011 J jnl
2-domination in bipartite graphs with odd independence number.
Australas. J Comb.
Adriana Hansberg, Lutz Volkmann
2011 J jnl
Bounds on the signed domatic number.
Appl. Math. Lett.
Lutz Volkmann
2011 J jnl
Characterization of trees with equal 2-domination number and domination number plus two.
Discuss. Math. Graph Theory
Mustapha Chellali, Lutz Volkmann
2011 J jnl
Connected global offensive
Discuss. Math. Graph Theory
Lutz Volkmann
2011 J jnl
Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
Ars Comb.
Lutz Volkmann
2011 J jnl
Independence and
Int. J. Comput. Math.
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
2011 J jnl
Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph.
Appl. Math. Lett.
Dirk Meierling, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2011 J jnl
On 2-domination and independence domination numbers of graphs.
Ars Comb.
Adriana Hansberg, Lutz Volkmann
2011 J jnl
On local connectivity of K
Australas. J Comb.
Andreas Holtkamp, Lutz Volkmann
2011 J jnl
On the Roman Bondage Number of Planar Graphs.
Graphs Comb.
Nader Jafari Rad, Lutz Volkmann
2011 J jnl
Roman bondage in graphs.
Discuss. Math. Graph Theory
Nader Jafari Rad, Lutz Volkmann
2011 J jnl
Signed domination and signed domatic numbers of digraphs.
Discuss. Math. Graph Theory
Lutz Volkmann
2011 J jnl
Signed star k-domatic number of a graph.
Contributions Discret. Math.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2011 J jnl
Unique response Roman domination in graphs.
Discret. Appl. Math.
E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann
2011 J jnl
Upper bounds on the signed total domatic number of graphs.
Discret. Appl. Math.
Lutz Volkmann
2010 J jnl
A general method in the theory of domination in graphs.
Int. J. Comput. Math.
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
2010 J jnl
Cycle factors in strongly connected local tournaments.
Discret. Math.
Dirk Meierling, Lutz Volkmann
2010 J jnl
Independence and global offensive alliance in graphs.
Australas. J Comb.
Mustapha Chellali, Lutz Volkmann
2010 J jnl
On almost 1-extendable graphs.
Australas. J Comb.
Lutz Volkmann
2010 J jnl
On local connectivity of graphs with given clique number.
J. Graph Theory
Andreas Holtkamp, Lutz Volkmann
2010 J jnl
On the geodetic and geodetic domination numbers of a graph.
Discret. Math.
Adriana Hansberg, Lutz Volkmann
2010 J jnl
Proof of a conjecture on game domination.
J. Graph Theory
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2010 J jnl
Signed star domatic number of a graph.
Discret. Appl. Math.
Maryam Atapour, Seyed Mahmoud Sheikholeslami, Arezoo N. Ghameshlou, Lutz Volkmann
2010 J jnl
Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
Ars Comb.
Lutz Volkmann
2010 J jnl
The Diameter of Almost Eulerian Digraphs.
Electron. J. Comb.
Peter Dankelmann, Lutz Volkmann
2010 J jnl
The Roman domatic number of a graph.
Appl. Math. Lett.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2009 J jnl
A characterization of even order trees with domination number half their order minus one.
Australas. J Comb.
Adriana Hansberg, Lutz Volkmann
2009 J jnl
A remark on degree sequences of multigraphs.
Math. Methods Oper. Res.
Dirk Meierling, Lutz Volkmann
2009 J jnl
Bounds on the global offensive
Discuss. Math. Graph Theory
Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann
2009 J jnl
Complementary cycles in regular multipartite tournaments, where one cycle has length five.
Discret. Math.
Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
2009 J jnl
Every cycle-connected multipartite tournament has a universal arc.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2009 J jnl
Global offensive alliance numbers in graphs with emphasis on trees.
Australas. J Comb.
Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann
2009 J jnl
Inverse degree and edge-connectivity.
Discret. Math.
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
2009 J jnl
Minimum size of a graph or digraph of given radius.
Inf. Process. Lett.
Peter Dankelmann, Lutz Volkmann
2009 J jnl
On regular (1, q)-extendable graphs.
Australas. J Comb.
Lutz Volkmann
2009 J jnl
On the connectivity of p-diamond-free graphs.
Discret. Math.
Andreas Holtkamp, Lutz Volkmann
2009 J jnl
On the existence of edge cuts leaving several large components.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2009 J jnl
On the number of cycles in local tournaments.
Discret. Math.
Dirk Meierling, Lutz Volkmann
2009 J jnl
Parity and disparity subgraphs.
Discret. Math.
Terry A. McKee, Lutz Volkmann
2009 J jnl
Some remarks on the signed domatic number of graphs with small minimum degree.
Appl. Math. Lett.
Lutz Volkmann
2009 J jnl
The signed domatic number of some regular graphs.
Discret. Appl. Math.
Dirk Meierling, Lutz Volkmann, Stephan Zitzen
2009 J jnl
Upper bounds on the k-domination number and the k-Roman domination number.
Discret. Appl. Math.
Adriana Hansberg, Lutz Volkmann
2008 J jnl
A characterization of bipartite graphs with independence number half their order.
Australas. J Comb.
Lutz Volkmann
2008 J jnl
A note on the 2-domination number of a tree.
Australas. J Comb.
Jun Fujisawa, Adriana Hansberg, Takahiro Kubo, Akira Saito, Masahide Sugita, Lutz Volkmann
2008 J jnl
A remark on the (2, 2)-domination number.
Discuss. Math. Graph Theory
Torsten Korneffel, Dirk Meierling, Lutz Volkmann
2008 J jnl
All 2-connected in-tournaments that are cycle complementary.
Discret. Math.
Dirk Meierling, Lutz Volkmann
2008 J jnl
Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2008 J jnl
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks
Dieter Rautenbach, Lutz Volkmann
2008 J jnl
How close to regular must a multipartite tournament be to secure a given path covering number?
Ars Comb.
Irene Stella, Lutz Volkmann, Stefan Winzen
2008 J jnl
Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Discret. Math.
Angelika Hellwig, Lutz Volkmann
2008 J jnl
On
J. Graph Theory
Odile Favaron, Adriana Hansberg, Lutz Volkmann
2008 J jnl
On arc-traceable local tournaments.
Discret. Math.
Dirk Meierling, Lutz Volkmann
2008 J jnl
On graphs with equal domination and 2-domination numbers.
Discret. Math.
Adriana Hansberg, Lutz Volkmann
2008 J jnl
On local connectivity of graphs.
Appl. Math. Lett.
Lutz Volkmann
2008 J jnl
On the order of almost regular bipartite graphs without perfect matchings.
Australas. J Comb.
Lutz Volkmann, Axel Zingsem
2008 J jnl
Restricted arc-connectivity of generalized tournaments.
Australas. J Comb.
Dirk Meierling, Lutz Volkmann, Stefan Winzen
2008 J jnl
Some remarks on lambda
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2008 J jnl
Strong subtournaments containing a given vertex in regular multipartite tournaments.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2008 J jnl
The connectivity of a graph and its complement.
Discret. Appl. Math.
Angelika Hellwig, Lutz Volkmann
2008 J jnl
alpha-Domination perfect trees.
Discret. Math.
F. Dahme, Dieter Rautenbach, Lutz Volkmann
2007 J jnl
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs.
Electron. J. Comb.
Lutz Volkmann
2007 J jnl
A remark on cycles through an arc in strongly connected multipartite tournaments.
Appl. Math. Lett.
Lutz Volkmann
2007 J jnl
Average distance in bipartite tournaments.
Ars Comb.
Peter Dankelmann, Lutz Volkmann
2007 J jnl
Characterization of block graphs with equal 2-domination number and domination number plus one.
Discuss. Math. Graph Theory
Adriana Hansberg Pastor, Lutz Volkmann
2007 J jnl
Distance Domination and Distance Irredundance in Graphs.
Electron. J. Comb.
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
2007 J jnl
Local-edge-connectivity in digraphs and oriented graphs.
Discret. Math.
Lutz Volkmann
2007 J jnl
Multipartite tournaments: A survey.
Discret. Math.
Lutz Volkmann
2007 J jnl
New bounds on the
Appl. Math. Lett.
Dieter Rautenbach, Lutz Volkmann
2007 J jnl
On the connectivity of diamond-free graphs.
Discret. Appl. Math.
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
2007 J jnl
On the number of nonseparating vertices in strongly connected local tournaments.
Australas. J Comb.
Dirk Meierling, Lutz Volkmann
2007 J jnl
On the order of close to regular graphs without a matching of given size.
Ars Comb.
Sabine Klinkenberg, Lutz Volkmann
2007 J jnl
Restricted arc-connectivity of digraphs.
Inf. Process. Lett.
Lutz Volkmann
2007 J jnl
Strongly 4-path-connectivity in almost regular multipartite tournaments.
Discret. Math.
Irene Stella, Lutz Volkmann, Stefan Winzen
2007 J jnl
Total and connected domination in digraphs.
Australas. J Comb.
S. Arumugam, K. Jacob, Lutz Volkmann
2006 J jnl
A lower bound for the irredundance number of trees.
Discuss. Math. Graph Theory
Michael Poschen, Lutz Volkmann
2006 J jnl
Degree sequence conditions for maximally edge-connected oriented graphs.
Appl. Math. Lett.
Lutz Volkmann
2006 J jnl
Extremal bipartite graphs with a unique k-factor.
Discuss. Math. Graph Theory
Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann
2006 J jnl
Longest cycles in almost regular 3-partite tournaments.
Discret. Math.
Lutz Volkmann
2006 J jnl
Lower bounds on the vertex-connectivity of digraphs and graphs.
Inf. Process. Lett.
Angelika Hellwig, Lutz Volkmann
2006 J jnl
On connectivity in graphs with given clique number.
J. Graph Theory
Angelika Hellwig, Lutz Volkmann
2006 J jnl
On cycles in regular 3-partite tournaments.
Discret. Math.
Lutz Volkmann
2006 J jnl
On the connectivity of close to regular multipartite tournaments.
Discret. Appl. Math.
Lutz Volkmann, Stefan Winzen
2006 J jnl
On the order of almost regular graphs without a matching of given size.
Australas. J Comb.
Sabine Klinkenberg, Lutz Volkmann
2006 J jnl
Otto Blumenthal (1876-1944) in retrospect.
J. Approx. Theory
Paul L. Butzer, Lutz Volkmann
2006 J jnl
Paths with a given number of vertices from each partite set in regular multipartite tournaments.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2006 J jnl
Some bounds on the p-domination number in trees.
Discret. Math.
Mostafa Blidia, Mustapha Chellali, Lutz Volkmann
2006 J jnl
Upper bounds on the domination number of a graph in terms of order and minimum degree.
Ars Comb.
Lutz Volkmann
2006 J jnl
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree.
Australas. J Comb.
Beate Küpper, Lutz Volkmann
2005 J jnl
A note on the number of matchings and independent sets in trees.
Discret. Appl. Math.
Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach
2005 J jnl
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c.
Australas. J Comb.
Lutz Volkmann, Stefan Winzen
2005 J jnl
Average distance in k-connected tournaments.
Ars Comb.
Peter Dankelmann, Lutz Volkmann
2005 J jnl
Complementary cycles in regular multipartite tournaments.
Australas. J Comb.
Lutz Volkmann
2005 J jnl
Cuts leaving components of given minimum order.
Discret. Math.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2005 J jnl
Extremal Trees with Respect to Dominance Order.
Ars Comb.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2005 J jnl
Neighborhood conditions for graphs and digraphs to be maximally edge-connected.
Australas. J Comb.
Angelika Hellwig, Lutz Volkmann
2005 J jnl
On the p-domination number of cactus graphs.
Discuss. Math. Graph Theory
Mostafa Blidia, Mustapha Chellali, Lutz Volkmann
2005 J jnl
Signed domatic number of a graph.
Discret. Appl. Math.
Lutz Volkmann, Bohdan Zelinka
2005 J jnl
Structural Remarks on Bipartite Graphs with Unique
Graphs Comb.
Arne Hoffmann, Lutz Volkmann
2005 J jnl
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.
J. Graph Theory
Angelika Hellwig, Lutz Volkmann
2005 J jnl
Unique irredundance, domination and independent domination in graphs.
Discret. Math.
Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich
2004 J jnl
All regular multipartite tournaments that are cycle complementary.
Discret. Math.
Lutz Volkmann
2004 J jnl
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2004 J jnl
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments.
Discret. Math.
Lutz Volkmann, Stefan Winzen
2004 J jnl
Extendable Cycles in Multipartite Tournaments.
Graphs Comb.
Yubao Guo, Lutz Volkmann
2004 J jnl
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments.
Discret. Math.
Lutz Volkmann
2004 J jnl
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.
Discret. Math.
Lutz Volkmann, Anders Yeo
2004 J jnl
Maximally local-edge-connected graphs and digraphs.
Ars Comb.
Angelika Hellwig, Lutz Volkmann
2004 J jnl
Note on the connectivity of line graphs.
Inf. Process. Lett.
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann
2004 J jnl
On Regular Factors in Regular Graphs with Small Radius.
Electron. J. Comb.
Arne Hoffmann, Lutz Volkmann
2004 J jnl
On the size of odd order graphs with no almost perfect matching.
Australas. J Comb.
Lutz Volkmann
2004 J jnl
On unique
Discret. Math.
Arne Hoffmann, Lutz Volkmann
2004 J jnl
Relations between the lower domination parameters and the chromatic number of a graph.
Discret. Math.
Mustapha Chellali, Lutz Volkmann
2004 J jnl
Some remarks on alpha-domination.
Discuss. Math. Graph Theory
F. Dahme, Dieter Rautenbach, Lutz Volkmann
2004 J jnl
Sufficient conditions for lambda'-optimality in graphs of diameter 2.
Discret. Math.
Angelika Hellwig, Lutz Volkmann
2004 J jnl
The Maximum Size Of Graphs With A Unique
Comb.
Lutz Volkmann
2004 J jnl
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].
Discret. Math.
Lutz Volkmann
2004 J jnl
Vertex 6-pancyclic in-tournaments.
Discret. Math.
Christian Peters, Lutz Volkmann
2003 J jnl
A Linear-programming Approach to the Generalized Randic Index.
Discret. Appl. Math.
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Cycles of length four through a given arc in almost regular multipartite tournaments.
Ars Comb.
Lutz Volkmann
2003 J jnl
Cycles through a given arc in almost regular multipartite tournaments.
Australas. J Comb.
Lutz Volkmann, Stefan Winzen
2003 J jnl
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number.
J. Graph Theory
Lutz Volkmann
2003 J jnl
Degree sequence conditions for super-edge-connected graphs and digraphs.
Ars Comb.
Lutz Volkmann
2003 J jnl
Extremal subgraphs with respect to vertex degree bounds.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Maximally edge-connected digraphs.
Australas. J Comb.
Angelika Hellwig, Lutz Volkmann
2003 J jnl
Maximum graphs with a unique minimum dominating set.
Discret. Math.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Minimum degree conditions for the Overfull Conjecture for odd order graphs.
Australas. J Comb.
Kerstin Bongard, Arne Hoffmann, Lutz Volkmann
2003 J jnl
On alpha
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Remarks on the bondage number of planar graphs.
Discret. Math.
Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann
2003 J jnl
Restricted edge-connectivity and minimum edge-degree.
Ars Comb.
Nicola Ueffing, Lutz Volkmann
2002 J jnl
A disproof of Henning's conjecture on irredundance perfect graphs.
Discret. Math.
Lutz Volkmann, Vadim E. Zverovich
2002 J jnl
Almost all almost regular
Discret. Math.
Meike Tewes, Lutz Volkmann, Anders Yeo
2002 J jnl
Cycles in multipartite tournaments: results and problems.
Discret. Math.
Lutz Volkmann
2002 J jnl
Cycles through a given arc in certain almost regular multipartite tournaments.
Australas. J Comb.
Lutz Volkmann
2002 J jnl
Edge-cuts leaving components of order at least three.
Discret. Math.
Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann
2002 J jnl
Graphs having distance-n domination number half their order.
Discret. Appl. Math.
Miranca Fischermann, Lutz Volkmann
2002 J jnl
How local irregularity gets global in a graph.
J. Graph Theory
Dieter Rautenbach, Lutz Volkmann
2002 J jnl
Independent domination and matchings in graphs.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
2002 J jnl
Longest paths through an arc in strong semicomplete multipartite digraphs.
Discret. Math.
Lutz Volkmann
2002 J jnl
Proof of a conjecture on irredundance perfect graphs.
J. Graph Theory
Lutz Volkmann, Vadim E. Zverovich
2002 J jnl
Unique minimum domination in trees.
Australas. J Comb.
Miranca Fischermann, Lutz Volkmann
2002 J jnl
Vertex pancyclic graphs.
Discret. Appl. Math.
Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
2002 J jnl
Weighted domination in triangle-free graphs.
Discret. Math.
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
2002 J jnl
Wiener index versus maximum degree in trees.
Discret. Appl. Math.
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
2001 J jnl
Spanning multipartite tournaments of semicomplete multipartite digraphs.
Ars Comb.
Lutz Volkmann
2001 J jnl
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.
Discret. Math.
Meike Tewes, Lutz Volkmann
2001 J jnl
Vertex pancyclic in-tournaments.
J. Graph Theory
Meike Tewes, Lutz Volkmann
2001 J jnl
i gamma(1)-perfect graphs.
Discret. Math.
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
2000 J jnl
A characterization of rho alpha(
Discret. Math.
Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann
2000 J jnl
Degree sequence conditions for maximally edge-connected graphs depending on the clique number.
Discret. Math.
Peter Dankelmann, Lutz Volkmann
2000 J jnl
Graphs with unique dominating sets.
Electron. Notes Discret. Math.
Miranca Fischermann, Lutz Volkmann
2000 J jnl
Longest paths through an arc in strongly connected in-tournaments.
Australas. J Comb.
Lutz Volkmann
2000 J jnl
Some results on graph parameters in weighted graphs.
Electron. Notes Discret. Math.
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
2000 J jnl
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Discret. Math.
Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo
1999 J jnl
Graphs having distance-n domination number half their order.
Electron. Notes Discret. Math.
Miranca Fischermann, Lutz Volkmann
1999 J jnl
Longest paths in semicomplete multipartite digraphs.
Discret. Math.
Lutz Volkmann
1999 J jnl
Maximal Sets of 2-Factors in Complete Equipartite Graphs.
Electron. Notes Discret. Math.
Arne Hoffmann, Bert Randerath, Lutz Volkmann
1999 J jnl
Strong subtournaments of multipartite tournaments.
Australas. J Comb.
Lutz Volkmann
1999 J jnl
Vertex Pancyclic Graphs.
Electron. Notes Discret. Math.
Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes
1999 J jnl
Vertex deletion and cycles in multipartite tournaments.
Discret. Math.
Meike Tewes, Lutz Volkmann
1998 J jnl
Characterization of graphs with equal domination and covering number.
Discret. Math.
Bert Randerath, Lutz Volkmann
1998 J jnl
On the cycle structure of in-tournaments.
Australas. J Comb.
Meike Tewes, Lutz Volkmann
1998 J jnl
Some structural results on linear arboricity.
Australas. J Comb.
Dieter Rautenbach, Lutz Volkmann
1998 J jnl
The domatic number of block-cactus graphs.
Discret. Math.
Dieter Rautenbach, Lutz Volkmann
1998 J jnl
The ratio of the irredundance and domination number of a graph.
Discret. Math.
Lutz Volkmann
1997 J jnl
A classification of locally semicomplete digraphs.
Discret. Math.
Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann
1997 J jnl
Bypaths in Tournaments.
Discret. Appl. Math.
Yubao Guo, Lutz Volkmann
1997 J jnl
Degree sequence conditions for maximally edge-connected graphs and digraphs.
J. Graph Theory
Peter Dankelmann, Lutz Volkmann
1997 J jnl
On cycles through a given vertex in multipartite tournaments.
Discret. Math.
Yubao Guo, Axel Pinkernell, Lutz Volkmann
1997 J jnl
Simplicial Graphs and Relationships to Different Graph Invariants.
Ars Comb.
Bert Randerath, Lutz Volkmann
1996 J jnl
A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments.
J. Comb. Theory B
Yubao Guo, Lutz Volkmann
1996 — book
Fundamente der Graphentheorie.
Lutz Volkmann
1996 J jnl
Independence number in n-extendable graphs.
Discret. Math.
Peter Maschlanka, Lutz Volkmann
1996 J jnl
Locally semicomplete digraphs that are complementary
J. Graph Theory
Yubao Guo, Lutz Volkmann
1996 J jnl
Neighbourhood and degree conditions for the existence of regular factors.
Ars Comb.
Ursala Lenkewitz, Lutz Volkmann
1996 J jnl
Weakly Hamiltonian-connected locally semicomplete digraphs.
J. Graph Theory
Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann
1995 J jnl
A generalization of menger's theorem for certain block - cactus graphs.
Graphs Comb.
Yubao Guo, Lutz Volkmann
1995 J jnl
New sufficient conditions for equality of minimum degree and edge-connectivity.
Ars Comb.
Peter Dankelmann, Lutz Volkmann
1995 J jnl
On graphs with equal domination and edge independence numbers.
Ars Comb.
Lutz Volkmann
1995 J jnl
Tree-Ramsey numbers.
Australas. J Comb.
Yabao Guo, Lutz Volkmann
1994 J jnl
A characterization of well covered block-cactus graphs.
Australas. J Comb.
Bert Randerath, Lutz Volkmann
1994 J jnl
Connectivity properties of locally semicomplete digraphs.
J. Graph Theory
Yubao Guo, Lutz Volkmann
1994 J jnl
Cycles in Multipartite Tournaments.
J. Comb. Theory B
Yubao Guo, Lutz Volkmann
1994 J jnl
On complementary cycles in locally semicomplete digraphs.
Discret. Math.
Yubao Guo, Lutz Volkmann
1994 J jnl
On unique independent sets in graphs.
Discret. Math.
Werner Siemes, Jerzy Topp, Lutz Volkmann
1994 J jnl
on Graphs with Equal Domination and Covering Numbers.
Discret. Appl. Math.
Lutz Volkmann
1993 J jnl
A new domination conception.
J. Graph Theory
Christoph Stracke, Lutz Volkmann
1993 J jnl
Some upper bounds for the product of the domination number and the chromatic number of a graph.
Discret. Math.
Jerzy Topp, Lutz Volkmann
1993 J jnl
Sufficient conditions for equality of connectivity and minimum degree of a graph.
J. Graph Theory
Jerzy Topp, Lutz Volkmann
1991 J jnl
On graphs with equal domination and independent domination numbers.
Discret. Math.
Jerzy Topp, Lutz Volkmann
1991 J jnl
On packing and covering numbers of graphs.
Discret. Math.
Jerzy Topp, Lutz Volkmann
1990 J jnl
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree.
J. Graph Theory
Thomas Niessen, Lutz Volkmann
1990 J jnl
Estimations for the domination number of a graph.
Discret. Math.
Peter Flach, Lutz Volkmann
1989 J jnl
Edge-connectivity in p-partite graphs.
J. Graph Theory
Lutz Volkmann