default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLutz Volkmann
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j274]Yubao Guo
, Lutz Volkmann, Yun Wang:
Signed total Roman domination and domatic numbers in graphs. Appl. Math. Comput. 487: 129074 (2025)- [j273]Peter Dankelmann, Y. Guo, Emily Rivett-Carnac, Lutz Volkmann:
The oriented diameter of graphs derived from other graphs. Discret. Math. 348(6): 114443 (2025) - 2024
- [j272]Seyed Mahmoud Sheikholeslami, M. Esmaeili, Lutz Volkmann:
Outer Independent Double Roman Domination Stability in Graphs. Ars Comb. 160(1): 21-29 (2024) - [j271]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Outer independent total double Italian domination number. Comput. Sci. J. Moldova 32(1): 19-37 (2024) - [j270]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
New bounds on the outer-independent total double Roman domination number. Discret. Math. Algorithms Appl. 16(4): 2350043:1-2350043:13 (2024) - 2023
- [j269]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Total Italian domatic number of graphs. Comput. Sci. J. Moldova 31(2): 169-182 (2023) - [j268]Lutz Volkmann:
Double Roman and double Italian domination. Discuss. Math. Graph Theory 43(3): 721-730 (2023) - 2022
- [j267]Lutz Volkmann:
Restrained Roman and restrained Italian domatic numbers of graphs. Discret. Appl. Math. 322: 153-159 (2022) - [j266]Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The Roman domatic problem in graphs and digraphs: a survey. Discuss. Math. Graph Theory 42(3): 861-891 (2022) - [j265]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs. RAIRO Oper. Res. 56(4): 2235-2243 (2022) - [j264]Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann:
Restrained double Roman domination of a graph. RAIRO Oper. Res. 56(4): 2293-2304 (2022) - 2021
- [j263]Zhen-Mu Hong, Zheng-Jiang Xia, Fu-Yuan Chen, Lutz Volkmann:
Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected. Complex. 2021: 5588146:1-5588146:11 (2021) - [j262]Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann:
Domination, independent domination number and 2-independence number in trees. Discuss. Math. Graph Theory 41(1): 39-49 (2021) - [j261]Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann:
Oriented diameter of maximal outerplanar graphs. J. Graph Theory 98(3): 426-444 (2021) - [j260]Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Nordhaus-Gaddum type results for connected and total domination. RAIRO Oper. Res. 55(Supplement): S853-S862 (2021) - 2020
- [j259]Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Varieties of Roman domination II. AKCE Int. J. Graphs Comb. 17(3): 966-984 (2020) - [j258]Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs. Contributions Discret. Math. 15(1): 154-162 (2020) - [j257]Doost Ali Mojdeh, Lutz Volkmann:
Roman {3}-domination (double Italian domination). Discret. Appl. Math. 283: 555-564 (2020) - [j256]R. Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
A proof of a conjecture on the differential of a subcubic graph. Discret. Appl. Math. 287: 27-39 (2020) - [j255]Sakineh Nazari-Moghaddam, Lutz Volkmann:
Critical concept for double Roman domination in graphs. Discret. Math. Algorithms Appl. 12(02): 2050020 (2020) - [j254]Lutz Volkmann:
The double Roman domatic number of a digraph. Discuss. Math. Graph Theory 40(4): 995-1004 (2020) - [j253]Zehui Shao, Doost Ali Mojdeh, Lutz Volkmann:
Total Roman {3}-domination in Graphs. Symmetry 12(2): 268 (2020)
2010 – 2019
- 2019
- [j252]Majid Hajian, Nader Jafari Rad, Lutz Volkmann:
Bounds on the fair total domination number in trees and unicyclic graphs. Australas. J Comb. 74: 460-475 (2019) - [j251]Lutz Volkmann:
The Roman {2}-domatic number of graphs. Discret. Appl. Math. 258: 235-241 (2019) - [j250]Xiaodan Chen, Guoliang Hao, Lutz Volkmann:
Bounds on the signed Roman k-domination number of a digraph. Discuss. Math. Graph Theory 39(1): 67-79 (2019) - [j249]Zehui Shao, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi, Lutz Volkmann, Xinmiao Liu:
On the co-Roman domination in graphs. Discuss. Math. Graph Theory 39(2): 455-472 (2019) - [j248]Lutz Volkmann:
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number. Discuss. Math. Graph Theory 39(2): 567-573 (2019) - 2018
- [j247]Sebastian Milz, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number. Discret. Math. 341(2): 484-491 (2018) - [j246]Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
An upper bound on the double Roman domination number. J. Comb. Optim. 36(1): 81-89 (2018) - 2017
- [j245]Lutz Volkmann:
Lower bounds on the signed k-domination number of graphs. Ars Comb. 135: 357-367 (2017) - [j244]Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow reinforcement numbers in graphs. Discret. Appl. Math. 217: 394-404 (2017) - [j243]Zhibing Chen, Guifu Su, Lutz Volkmann:
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. Discret. Appl. Math. 218: 64-70 (2017) - [j242]Wei Meng, Jia Guo, Mei Lu, Yubao Guo, Lutz Volkmann:
Universal arcs in local tournaments. Discret. Math. 340(12): 2900-2915 (2017) - [j241]Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed Roman edge k-domination in graphs. Discuss. Math. Graph Theory 37(1): 39-53 (2017) - [j240]Lutz Volkmann:
Signed total Roman domination in digraphs. Discuss. Math. Graph Theory 37(1): 261-272 (2017) - [j239]Lutz Volkmann:
The signed total Roman k-domatic number of a graph. Discuss. Math. Graph Theory 37(4): 1027-1038 (2017) - [j238]S. M. Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
On the signed 2-independence number of graphs. Electron. J. Graph Theory Appl. 5(1): 36-42 (2017) - [j237]A. Bahremandpour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Roman game domination number of a graph. J. Comb. Optim. 33(2): 713-725 (2017) - [j236]Masoud Atapour, Nasrin Dehgardi, Lutz Volkmann:
An introduction to the twin signed total k-domination numbers in directed graphs. RAIRO Oper. Res. 51(4): 1331-1343 (2017) - 2016
- [j235]Lutz Volkmann:
The signed Roman k-domatic number of digraphs. Australas. J Comb. 64: 444-457 (2016) - [j234]Nader Jafari Rad, Lutz Volkmann:
Total restrained reinforcement in graphs. AKCE Int. J. Graphs Comb. 13(1): 16-21 (2016) - [j233]Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Rainbow restrained domination numbers in graphs. Ars Comb. 124: 3-19 (2016) - [j232]Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Vladimir Samodivkin, Lutz Volkmann:
On the rainbow restrained domination number. Ars Comb. 125: 209-224 (2016) - [j231]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed (j, k)-domatic number of graphs. Ars Comb. 126: 73-86 (2016) - [j230]Nader Jafari Rad, Lutz Volkmann:
Matchings in 4-total restrained domination vertex critical graphs. Ars Comb. 128: 415-428 (2016) - [j229]Lutz Volkmann:
On the signed total Roman domination and domatic numbers of graphs. Discret. Appl. Math. 214: 179-186 (2016) - [j228]Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
New bounds on the signed total domination number of graphs. Discuss. Math. Graph Theory 36(2): 467-477 (2016) - [j227]Michael A. Henning, Lutz Volkmann:
Signed Roman k-Domination in Graphs. Graphs Comb. 32(1): 175-190 (2016) - [j226]Nader Jafari Rad, Lutz Volkmann:
Edge-Removal and Edge-Addition in α-Domination. Graphs Comb. 32(3): 1155-1166 (2016) - [j225]Lutz Volkmann:
Signed Roman k-domination in Digraphs. Graphs Comb. 32(3): 1217-1227 (2016) - [j224]Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann, Yancai Zhao:
Signed Roman edge domination numbers in graphs. J. Comb. Optim. 31(1): 333-346 (2016) - [j223]Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed mixed Roman domination numbers in graphs. J. Comb. Optim. 32(1): 299-317 (2016) - [j222]Lutz Volkmann:
Signed total Roman domination in graphs. J. Comb. Optim. 32(3): 855-871 (2016) - [j221]Nader Jafari Rad, Lutz Volkmann:
Generalization of the total outer-connected domination in graphs. RAIRO Oper. Res. 50(2): 233-239 (2016) - 2015
- [j220]Odile Favaron, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed k-domatic numbers of graphs. Ars Comb. 123: 169-184 (2015) - [j219]Lutz Volkmann:
The signed Roman k-domatic number of a graph. Discret. Appl. Math. 180: 150-157 (2015) - [j218]Michael A. Henning, Lutz Volkmann:
Signed Roman k-domination in trees. Discret. Appl. Math. 186: 98-105 (2015) - [j217]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed star (j, k)-domatic numbers of digraphs. Discret. Math. Algorithms Appl. 7(2): 1550006:1-1550006:12 (2015) - [j216]Jafar Amjadi, Negar Mohammadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow bondage number of a digraph. Discuss. Math. Graph Theory 35(2): 261-270 (2015) - [j215]Lutz Volkmann:
Upper bounds on the signed total (k, k)-domatic number of graphs. Discuss. Math. Graph Theory 35(4): 641-650 (2015) - [j214]Abdollah Khodkar, Babak Samadi, Lutz Volkmann:
On the signed (total) k-independence number in graphs. Discuss. Math. Graph Theory 35(4): 651-662 (2015) - [j213]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The signed Roman domatic number of a digraph. Electron. J. Graph Theory Appl. 3(1): 85-93 (2015) - [j212]M. Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Global Roman Domination in Trees. Graphs Comb. 31(4): 813-825 (2015) - [j211]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed Roman domination in digraphs. J. Comb. Optim. 30(3): 456-467 (2015) - 2014
- [j210]Mostafa Blidia, Ahmed Bouchou, Lutz Volkmann:
Bounds on the k-independence and k-chromatic numbers of graphs. Ars Comb. 113: 33-46 (2014) - [j209]Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow bondage number of a graph. Discret. Appl. Math. 174: 133-139 (2014) - 2013
- [j208]Lutz Volkmann:
Signed total (j, k)-domatic numbers of graphs. Australas. J Comb. 57: 39-48 (2013) - [j207]Lutz Volkmann:
Smallest regular and almost regular triangle-free graphs without perfect matchings. Ars Comb. 111: 463-472 (2013) - [j206]Lutz Volkmann:
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four. Discret. Appl. Math. 161(13-14): 2169-2177 (2013) - [j205]Nader Jafari Rad, Lutz Volkmann:
A note on the independent domination number in graphs. Discret. Appl. Math. 161(18): 3087-3089 (2013) - [j204]Lutz Volkmann:
Bounds on the signed 2-independence number in graphs. Discuss. Math. Graph Theory 33(4): 709-715 (2013) - [j203]Hamideh Aram, S. Norouzian, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The distance Roman domination numbers of graphs. Discuss. Math. Graph Theory 33(4): 717-730 (2013) - [j202]Nader Jafari Rad, Lutz Volkmann:
Roman Domination Dot-critical Graphs. Graphs Comb. 29(3): 527-533 (2013) - 2012
- [j201]Lutz Volkmann:
The smallest regular graphs which are not 1-extendable. Ars Comb. 104: 179-184 (2012) - [j200]Lutz Volkmann:
On regular (2, q)-extendable graphs. Ars Comb. 105: 53-64 (2012) - [j199]Dirk Meierling, Lutz Volkmann:
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. Discret. Appl. Math. 160(12): 1775-1781 (2012) - [j198]Lutz Volkmann:
Signed 2-independence in digraphs. Discret. Math. 312(2): 465-471 (2012) - [j197]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed total {k}-domination and {k}-Domatic numbers of Graphs. Discret. Math. Algorithms Appl. 4(1) (2012) - [j196]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow domatic number of a graph. Discuss. Math. Graph Theory 32(1): 129-140 (2012) - [j195]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The total {k}-domatic number of digraphs. Discuss. Math. Graph Theory 32(3): 461-471 (2012) - [r1]Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann:
k-Domination and k-Independence in Graphs: A Survey. Graphs Comb. 28(1): 1-55 (2012) - [j194]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The total {k}-domatic number of a graph. J. Comb. Optim. 23(2): 252-260 (2012) - 2011
- [j193]Andreas Holtkamp, Lutz Volkmann:
On local connectivity of K2, p-free graphs. Australas. J Comb. 51: 29-40 (2011) - [j192]Adriana Hansberg, Lutz Volkmann:
2-domination in bipartite graphs with odd independence number. Australas. J Comb. 51: 115-124 (2011) - [j191]Lutz Volkmann:
Bounds on the signed domatic number. Appl. Math. Lett. 24(2): 196-198 (2011) - [j190]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) - [j189]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) - [j188]Adriana Hansberg, Lutz Volkmann:
On 2-domination and independence domination numbers of graphs. Ars Comb. 101: 405-415 (2011) - [j187]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed star k-domatic number of a graph. Contributions Discret. Math. 6(2) (2011) - [j186]Lutz Volkmann:
Upper bounds on the signed total domatic number of graphs. Discret. Appl. Math. 159(8): 832-837 (2011) - [j185]E. Ebrahimi Targhi, Nader Jafari Rad, Lutz Volkmann:
Unique response Roman domination in graphs. Discret. Appl. Math. 159(11): 1110-1117 (2011) - [j184]Lutz Volkmann:
Signed domination and signed domatic numbers of digraphs. Discuss. Math. Graph Theory 31(3): 415-427 (2011) - [j183]Mustapha Chellali, Lutz Volkmann:
Characterization of trees with equal 2-domination number and domination number plus two. Discuss. Math. Graph Theory 31(4): 687-697 (2011) - [j182]Lutz Volkmann:
Connected global offensive k-alliances in graphs. Discuss. Math. Graph Theory 31(4): 699-707 (2011) - [j181]Nader Jafari Rad, Lutz Volkmann:
Roman bondage in graphs. Discuss. Math. Graph Theory 31(4): 763-773 (2011) - [j180]Nader Jafari Rad, Lutz Volkmann:
On the Roman Bondage Number of Planar Graphs. Graphs Comb. 27(4): 531-538 (2011) - [j179]Adriana Hansberg, Dirk Meierling, Lutz Volkmann:
Independence and k-domination in graphs. Int. J. Comput. Math. 88(5): 905-915 (2011) - 2010
- [j178]Lutz Volkmann:
On almost 1-extendable graphs. Australas. J Comb. 47: 83-90 (2010) - [j177]Mustapha Chellali, Lutz Volkmann:
Independence and global offensive alliance in graphs. Australas. J Comb. 47: 125-132 (2010) - [j176]Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The Roman domatic number of a graph. Appl. Math. Lett. 23(10): 1295-1300 (2010) - [j175]Lutz Volkmann:
Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. Ars Comb. 96 (2010) - [j174]Peter Dankelmann, Lutz Volkmann:
The Diameter of Almost Eulerian Digraphs. Electron. J. Comb. 17(1) (2010) - [j173]M. Atapour, Seyed Mahmoud Sheikholeslami, Arezoo N. Ghameshlou, Lutz Volkmann:
Signed star domatic number of a graph. Discret. Appl. Math. 158(3): 213-218 (2010) - [j172]Dirk Meierling, Lutz Volkmann:
Cycle factors in strongly connected local tournaments. Discret. Math. 310(4): 850-860 (2010) - [j171]Adriana Hansberg, Lutz Volkmann:
On the geodetic and geodetic domination numbers of a graph. Discret. Math. 310(15-16): 2140-2146 (2010) - [j170]Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann:
k-independence stable graphs upon edge removal. Discuss. Math. Graph Theory 30(2): 265-274 (2010) - [j169]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) - [j168]Andreas Holtkamp, Lutz Volkmann:
On local connectivity of graphs with given clique number. J. Graph Theory 63(3): 192-197 (2010) - [j167]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Proof of a conjecture on game domination. J. Graph Theory 64(4): 323-329 (2010)
2000 – 2009
- 2009
- [j166]Adriana Hansberg, Lutz Volkmann:
A characterization of even order trees with domination number half their order minus one. Australas. J Comb. 44: 247-254 (2009) - [j165]Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann:
Global offensive alliance numbers in graphs with emphasis on trees. Australas. J Comb. 45: 87-96 (2009) - [j164]Lutz Volkmann:
On regular (1, q)-extendable graphs. Australas. J Comb. 45: 207-216 (2009) - [j163]Lutz Volkmann:
Some remarks on the signed domatic number of graphs with small minimum degree. Appl. Math. Lett. 22(8): 1166-1169 (2009) - [j162]Adriana Hansberg, Lutz Volkmann:
Upper bounds on the k-domination number and the k-Roman domination number. Discret. Appl. Math. 157(7): 1634-1639 (2009) - [j161]Dirk Meierling, Lutz Volkmann, Stephan Zitzen:
The signed domatic number of some regular graphs. Discret. Appl. Math. 157(8): 1905-1912 (2009) - [j160]Lutz Volkmann, Stefan Winzen:
Every cycle-connected multipartite tournament has a universal arc. Discret. Math. 309(4): 1013-1017 (2009) - [j159]Dieter Rautenbach, Lutz Volkmann:
On the existence of edge cuts leaving several large components. Discret. Math. 309(6): 1703-1707 (2009) - [j158]Dirk Meierling, Lutz Volkmann:
On the number of cycles in local tournaments. Discret. Math. 309(8): 2042-2052 (2009) - [j157]Terry A. McKee, Lutz Volkmann:
Parity and disparity subgraphs. Discret. Math. 309(8): 2608-2612 (2009) - [j156]Peter Dankelmann, Angelika Hellwig, Lutz Volkmann:
Inverse degree and edge-connectivity. Discret. Math. 309(9): 2943-2947 (2009) - [j155]Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen:
Complementary cycles in regular multipartite tournaments, where one cycle has length five. Discret. Math. 309(10): 3131-3149 (2009) - [j154]Andreas Holtkamp, Lutz Volkmann:
On the connectivity of p-diamond-free graphs. Discret. Math. 309(20): 6065-6069 (2009) - [j153]Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann:
Bounds on the global offensive k-alliance number in graphs. Discuss. Math. Graph Theory 29(3): 597-613 (2009) - [j152]Peter Dankelmann, Lutz Volkmann:
Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009) - [j151]Dirk Meierling, Lutz Volkmann:
A remark on degree sequences of multigraphs. Math. Methods Oper. Res. 69(2): 369-374 (2009) - 2008
- [j150]Jun Fujisawa, Adriana Hansberg, Takahiro Kubo, Akira Saito, Masahide Sugita, Lutz Volkmann:
A note on the 2-domination number of a tree. Australas. J Comb. 40: 265-268 (2008) - [j149]Dirk Meierling, Lutz Volkmann, Stefan Winzen:
Restricted arc-connectivity of generalized tournaments. Australas. J Comb. 40: 269-278 (2008) - [j148]Lutz Volkmann:
A characterization of bipartite graphs with independence number half their order. Australas. J Comb. 41: 219-222 (2008) - [j147]Lutz Volkmann, Axel Zingsem:
On the order of almost regular bipartite graphs without perfect matchings. Australas. J Comb. 42: 165-170 (2008) - [j146]Lutz Volkmann:
On local connectivity of graphs. Appl. Math. Lett. 21(1): 63-66 (2008) - [j145]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) - [j144]Angelika Hellwig, Lutz Volkmann:
The connectivity of a graph and its complement. Discret. Appl. Math. 156(17): 3325-3328 (2008) - [j143]Lutz Volkmann, Stefan Winzen:
Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. Discret. Math. 308(9): 1710-1721 (2008) - [j142]Dirk Meierling, Lutz Volkmann:
All 2-connected in-tournaments that are cycle complementary. Discret. Math. 308(11): 2115-2133 (2008) - [j141]Adriana Hansberg, Lutz Volkmann:
On graphs with equal domination and 2-domination numbers. Discret. Math. 308(11): 2277-2281 (2008) - [j140]F. Dahme, Dieter Rautenbach, Lutz Volkmann:
alpha-Domination perfect trees. Discret. Math. 308(15): 3187-3198 (2008) - [j139]Angelika Hellwig, Lutz Volkmann:
Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Discret. Math. 308(15): 3265-3296 (2008) - [j138]Lutz Volkmann, Stefan Winzen:
Strong subtournaments containing a given vertex in regular multipartite tournaments. Discret. Math. 308(23): 5516-5521 (2008) - [j137]Dieter Rautenbach, Lutz Volkmann:
Some remarks on lambdap, q-connectedness. Discret. Math. 308(23): 5562-5569 (2008) - [j136]Dirk Meierling, Lutz Volkmann:
On arc-traceable local tournaments. Discret. Math. 308(24): 6513-6526 (2008) - [j135]Torsten Korneffel, Dirk Meierling, Lutz Volkmann:
A remark on the (2, 2)-domination number. Discuss. Math. Graph Theory 28(2): 361-366 (2008) - [j134]Odile Favaron, Adriana Hansberg, Lutz Volkmann:
On k-domination and minimum degree in graphs. J. Graph Theory 57(1): 33-40 (2008) - [j133]Dieter Rautenbach, Lutz Volkmann:
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles. Networks 52(4): 252-255 (2008) - 2007
- [j132]S. Arumugam, K. Jacob, Lutz Volkmann:
Total and connected domination in digraphs. Australas. J Comb. 39: 283-292 (2007) - [j131]Dirk Meierling, Lutz Volkmann:
On the number of nonseparating vertices in strongly connected local tournaments. Australas. J Comb. 39: 301- (2007) - [j130]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) - [j129]Lutz Volkmann:
A remark on cycles through an arc in strongly connected multipartite tournaments. Appl. Math. Lett. 20(11): 1148-1150 (2007) - [j128]Peter Dankelmann, Lutz Volkmann:
Average distance in bipartite tournaments. Ars Comb. 83 (2007) - [j127]Sabine Klinkenberg, Lutz Volkmann:
On the order of close to regular graphs without a matching of given size. Ars Comb. 85 (2007) - [j126]Adriana Hansberg, Dirk Meierling, Lutz Volkmann:
Distance Domination and Distance Irredundance in Graphs. Electron. J. Comb. 14(1) (2007) - [j125]Lutz Volkmann:
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs. Electron. J. Comb. 14(1) (2007) - [j124]Peter Dankelmann, Angelika Hellwig, Lutz Volkmann:
On the connectivity of diamond-free graphs. Discret. Appl. Math. 155(16): 2111-2117 (2007) - [j123]Lutz Volkmann:
Multipartite tournaments: A survey. Discret. Math. 307(24): 3097-3129 (2007) - [j122]Lutz Volkmann:
Local-edge-connectivity in digraphs and oriented graphs. Discret. Math. 307(24): 3207-3212 (2007) - [j121]Irene Stella, Lutz Volkmann, Stefan Winzen:
Strongly 4-path-connectivity in almost regular multipartite tournaments. Discret. Math. 307(24): 3213-3219 (2007) - [j120]Adriana Hansberg Pastor, Lutz Volkmann:
Characterization of block graphs with equal 2-domination number and domination number plus one. Discuss. Math. Graph Theory 27(1): 93-103 (2007) - [j119]Lutz Volkmann:
Restricted arc-connectivity of digraphs. Inf. Process. Lett. 103(6): 234-239 (2007) - 2006
- [j118]Sabine Klinkenberg, Lutz Volkmann:
On the order of almost regular graphs without a matching of given size. Australas. J Comb. 34: 187-194 (2006) - [j117]Beate Küpper, Lutz Volkmann:
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree. Australas. J Comb. 35: 133-140 (2006) - [j116]Lutz Volkmann:
Degree sequence conditions for maximally edge-connected oriented graphs. Appl. Math. Lett. 19(11): 1255-1260 (2006) - [j115]Lutz Volkmann:
Upper bounds on the domination number of a graph in terms of order and minimum degree. Ars Comb. 81 (2006) - [j114]Lutz Volkmann, Stefan Winzen:
On the connectivity of close to regular multipartite tournaments. Discret. Appl. Math. 154(9): 1437-1452 (2006) - [j113]Lutz Volkmann:
On cycles in regular 3-partite tournaments. Discret. Math. 306(12): 1198-1206 (2006) - [j112]Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
Some bounds on the p-domination number in trees. Discret. Math. 306(17): 2031-2037 (2006) - [j111]Lutz Volkmann, Stefan Winzen:
Paths with a given number of vertices from each partite set in regular multipartite tournaments. Discret. Math. 306(21): 2724-2732 (2006) - [j110]Lutz Volkmann:
Longest cycles in almost regular 3-partite tournaments. Discret. Math. 306(22): 2931-2942 (2006) - [j109]Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann:
Extremal bipartite graphs with a unique k-factor. Discuss. Math. Graph Theory 26(2): 181-192 (2006) - [j108]Michael Poschen, Lutz Volkmann:
A lower bound for the irredundance number of trees. Discuss. Math. Graph Theory 26(2): 209-215 (2006) - [j107]Angelika Hellwig, Lutz Volkmann:
Lower bounds on the vertex-connectivity of digraphs and graphs. Inf. Process. Lett. 99(2): 41-46 (2006) - [j106]Paul L. Butzer, Lutz Volkmann:
Otto Blumenthal (1876-1944) in retrospect. J. Approx. Theory 138(1): 1-36 (2006) - [j105]Angelika Hellwig, Lutz Volkmann:
On connectivity in graphs with given clique number. J. Graph Theory 52(1): 7-14 (2006) - 2005
- [j104]Lutz Volkmann, Stefan Winzen:
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c. Australas. J Comb. 31: 61-84 (2005) - [j103]Lutz Volkmann:
Complementary cycles in regular multipartite tournaments. Australas. J Comb. 31: 119-134 (2005) - [j102]Angelika Hellwig, Lutz Volkmann:
Neighborhood conditions for graphs and digraphs to be maximally edge-connected. Australas. J Comb. 33: 265-278 (2005) - [j101]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Extremal Trees with Respect to Dominance Order. Ars Comb. 76 (2005) - [j100]Peter Dankelmann, Lutz Volkmann:
Average distance in k-connected tournaments. Ars Comb. 77 (2005) - [j99]Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach:
A note on the number of matchings and independent sets in trees. Discret. Appl. Math. 145(3): 483-489 (2005) - [j98]Lutz Volkmann, Bohdan Zelinka:
Signed domatic number of a graph. Discret. Appl. Math. 150(1-3): 261-267 (2005) - [j97]Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann:
Cuts leaving components of given minimum order. Discret. Math. 292(1-3): 55-65 (2005) - [j96]Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich:
Unique irredundance, domination and independent domination in graphs. Discret. Math. 305(1-3): 190-200 (2005) - [j95]Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
On the p-domination number of cactus graphs. Discuss. Math. Graph Theory 25(3): 355-361 (2005) - [j94]Arne Hoffmann, Lutz Volkmann:
Structural Remarks on Bipartite Graphs with Unique f-Factors. Graphs Comb. 21(4): 421-425 (2005) - [j93]Angelika Hellwig, Lutz Volkmann:
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. J. Graph Theory 48(3): 228-246 (2005) - 2004
- [j92]Lutz Volkmann:
On the size of odd order graphs with no almost perfect matching. Australas. J Comb. 29: 119-126 (2004) - [j91]Angelika Hellwig, Lutz Volkmann:
Maximally local-edge-connected graphs and digraphs. Ars Comb. 72 (2004) - [j90]Lutz Volkmann:
The Maximum Size Of Graphs With A Unique k- Factor. Comb. 24(3): 531-540 (2004) - [j89]Arne Hoffmann, Lutz Volkmann:
On Regular Factors in Regular Graphs with Small Radius. Electron. J. Comb. 11(1) (2004) - [j88]Mustapha Chellali, Lutz Volkmann:
Relations between the lower domination parameters and the chromatic number of a graph. Discret. Math. 274(1-3): 1-8 (2004) - [j87]Arne Hoffmann, Lutz Volkmann:
On unique k-factors and unique [1, k]-factors in graphs. Discret. Math. 278(1-3): 127-138 (2004) - [j86]Lutz Volkmann:
All regular multipartite tournaments that are cycle complementary. Discret. Math. 281(1-3): 255-266 (2004) - [j85]Lutz Volkmann, Anders Yeo:
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Discret. Math. 281(1-3): 267-276 (2004) - [j84]Angelika Hellwig, Lutz Volkmann:
Sufficient conditions for lambda'-optimality in graphs of diameter 2. Discret. Math. 283(1-3): 113-120 (2004) - [j83]Lutz Volkmann, Stefan Winzen:
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. Discret. Math. 283(1-3): 217-229 (2004) - [j82]Christian Peters, Lutz Volkmann:
Vertex 6-pancyclic in-tournaments. Discret. Math. 285(1-3): 227-238 (2004) - [j81]Lutz Volkmann, Stefan Winzen:
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. Discret. Math. 285(1-3): 267-278 (2004) - [j80]Lutz Volkmann:
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. Discret. Math. 285(1-3): 359-364 (2004) - [j79]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]. Discret. Math. 287(1-3): 193-194 (2004) - [j78]F. Dahme, Dieter Rautenbach, Lutz Volkmann:
Some remarks on alpha-domination. Discuss. Math. Graph Theory 24(3): 423-430 (2004) - [j77]Yubao Guo, Lutz Volkmann:
Extendable Cycles in Multipartite Tournaments. Graphs Comb. 20(2): 185-190 (2004) - [j76]Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann:
Note on the connectivity of line graphs. Inf. Process. Lett. 91(1): 7-10 (2004) - 2003
- [j75]Angelika Hellwig, Lutz Volkmann:
Maximally edge-connected digraphs. Australas. J Comb. 27: 23-32 (2003) - [j74]Lutz Volkmann, Stefan Winzen:
Cycles through a given arc in almost regular multipartite tournaments. Australas. J Comb. 27: 223-246 (2003) - [j73]Kerstin Bongard, Arne Hoffmann, Lutz Volkmann:
Minimum degree conditions for the Overfull Conjecture for odd order graphs. Australas. J Comb. 28: 121-130 (2003) - [j72]Nicola Ueffing, Lutz Volkmann:
Restricted edge-connectivity and minimum edge-degree. Ars Comb. 66 (2003) - [j71]Lutz Volkmann:
Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Comb. 67 (2003) - [j70]Lutz Volkmann:
Cycles of length four through a given arc in almost regular multipartite tournaments. Ars Comb. 68 (2003) - [j69]Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann:
A Linear-programming Approach to the Generalized Randic Index. Discret. Appl. Math. 128(2-3): 375-385 (2003) - [j68]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Remarks on the bondage number of planar graphs. Discret. Math. 260(1-3): 57-67 (2003) - [j67]Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Maximum graphs with a unique minimum dominating set. Discret. Math. 260(1-3): 197-203 (2003) - [j66]Dieter Rautenbach, Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds. Discret. Math. 263(1-3): 297-303 (2003) - [j65]Dieter Rautenbach, Lutz Volkmann:
On alphargammas(k)-perfect graphs. Discret. Math. 270(1-3): 240-249 (2003) - [j64]Lutz Volkmann:
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. J. Graph Theory 42(3): 234-245 (2003) - 2002
- [j63]Miranca Fischermann, Lutz Volkmann:
Unique minimum domination in trees. Australas. J Comb. 25: 117-124 (2002) - [j62]Lutz Volkmann:
Cycles through a given arc in certain almost regular multipartite tournaments. Australas. J Comb. 26: 121-134 (2002) - [j61]Miranca Fischermann, Lutz Volkmann:
Graphs having distance-n domination number half their order. Discret. Appl. Math. 120(1-3): 97-107 (2002) - [j60]Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann:
Vertex pancyclic graphs. Discret. Appl. Math. 120(1-3): 219-237 (2002) - [j59]Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann:
Wiener index versus maximum degree in trees. Discret. Appl. Math. 122(1-3): 127-137 (2002) - [j58]Meike Tewes, Lutz Volkmann, Anders Yeo:
Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. Discret. Math. 242(1-3): 201-228 (2002) - [j57]Lutz Volkmann:
Cycles in multipartite tournaments: results and problems. Discret. Math. 245(1-3): 19-53 (2002) - [j56]Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Weighted domination in triangle-free graphs. Discret. Math. 250(1-3): 233-239 (2002) - [j55]Lutz Volkmann, Vadim E. Zverovich:
A disproof of Henning's conjecture on irredundance perfect graphs. Discret. Math. 254(1-3): 539-554 (2002) - [j54]Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann:
Edge-cuts leaving components of order at least three. Discret. Math. 256(1-2): 431-439 (2002) - [j53]Lutz Volkmann:
Longest paths through an arc in strong semicomplete multipartite digraphs. Discret. Math. 258(1-3): 331-337 (2002) - [j52]Dieter Rautenbach, Lutz Volkmann:
Independent domination and matchings in graphs. Discret. Math. 259(1-3): 325-330 (2002) - [j51]Dieter Rautenbach, Lutz Volkmann:
How local irregularity gets global in a graph. J. Graph Theory 41(1): 18-23 (2002) - [j50]Lutz Volkmann, Vadim E. Zverovich:
Proof of a conjecture on irredundance perfect graphs. J. Graph Theory 41(4): 292-306 (2002) - 2001
- [j49]Lutz Volkmann:
Spanning multipartite tournaments of semicomplete multipartite digraphs. Ars Comb. 58 (2001) - [j48]Meike Tewes, Lutz Volkmann:
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. Discret. Math. 231(1-3): 453-457 (2001) - [j47]Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
i gamma(1)-perfect graphs. Discret. Math. 234(1-3): 133-138 (2001) - [j46]Meike Tewes, Lutz Volkmann:
Vertex pancyclic in-tournaments. J. Graph Theory 36(2): 84-104 (2001) - 2000
- [j45]Lutz Volkmann:
Longest paths through an arc in strongly connected in-tournaments. Australas. J Comb. 21: 95-106 (2000) - [j44]Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discret. Math. 211: 217-223 (2000) - [j43]Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo:
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. Discret. Math. 212(1-2): 91-100 (2000) - [j42]Lothar Dohmen, Dieter Rautenbach, Lutz Volkmann:
A characterization of rho alpha(k)-perfect graphs. Discret. Math. 224(1-3): 265-271 (2000) - [j41]Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Some results on graph parameters in weighted graphs. Electron. Notes Discret. Math. 5: 85-88 (2000) - [j40]Miranca Fischermann, Lutz Volkmann:
Graphs with unique dominating sets. Electron. Notes Discret. Math. 5: 123-125 (2000)
1990 – 1999
- 1999
- [j39]Lutz Volkmann:
Strong subtournaments of multipartite tournaments. Australas. J Comb. 20: 189-196 (1999) - [j38]Meike Tewes, Lutz Volkmann:
Vertex deletion and cycles in multipartite tournaments. Discret. Math. 197-198: 769-779 (1999) - [j37]Lutz Volkmann:
Longest paths in semicomplete multipartite digraphs. Discret. Math. 199(1-3): 279-284 (1999) - [j36]Miranca Fischermann, Lutz Volkmann:
Graphs having distance-n domination number half their order. Electron. Notes Discret. Math. 3: 51-54 (1999) - [j35]Arne Hoffmann, Bert Randerath, Lutz Volkmann:
Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electron. Notes Discret. Math. 3: 82-85 (1999) - [j34]Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes:
Vertex Pancyclic Graphs. Electron. Notes Discret. Math. 3: 166-170 (1999) - 1998
- [j33]Dieter Rautenbach, Lutz Volkmann:
Some structural results on linear arboricity. Australas. J Comb. 17: 267-274 (1998) - [j32]Meike Tewes, Lutz Volkmann:
On the cycle structure of in-tournaments. Australas. J Comb. 18: 293-302 (1998) - [j31]Lutz Volkmann:
The ratio of the irredundance and domination number of a graph. Discret. Math. 178(1-3): 221-228 (1998) - [j30]Dieter Rautenbach, Lutz Volkmann:
The domatic number of block-cactus graphs. Discret. Math. 187(1-3): 185-193 (1998) - [j29]Bert Randerath, Lutz Volkmann:
Characterization of graphs with equal domination and covering number. Discret. Math. 191(1-3): 159-169 (1998) - 1997
- [j28]Bert Randerath, Lutz Volkmann:
Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46 (1997) - [j27]Yubao Guo, Lutz Volkmann:
Bypaths in Tournaments. Discret. Appl. Math. 79(1-3): 127-135 (1997) - [j26]Yubao Guo, Axel Pinkernell, Lutz Volkmann:
On cycles through a given vertex in multipartite tournaments. Discret. Math. 164(1-3): 165-170 (1997) - [j25]Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann:
A classification of locally semicomplete digraphs. Discret. Math. 167-168: 101-114 (1997) - [j24]Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26(1): 27-34 (1997) - 1996
- [b1]Lutz Volkmann:
Fundamente der Graphentheorie. Springer Lehrbuch Mathematik, Springer 1996, ISBN 978-3-211-82774-1, pp. I-XIX, 1-445 - [j23]Ursala Lenkewitz, Lutz Volkmann:
Neighbourhood and degree conditions for the existence of regular factors. Ars Comb. 42 (1996) - [j22]Peter Maschlanka, Lutz Volkmann:
Independence number in n-extendable graphs. Discret. Math. 154(1-3): 167-178 (1996) - [j21]Yubao Guo, Lutz Volkmann:
A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments. J. Comb. Theory B 66(1): 140-145 (1996) - [j20]Yubao Guo, Lutz Volkmann:
Locally semicomplete digraphs that are complementary m-pancyclic. J. Graph Theory 21(2): 121-136 (1996) - [j19]Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann:
Weakly Hamiltonian-connected locally semicomplete digraphs. J. Graph Theory 21(2): 163-172 (1996) - 1995
- [j18]Yabao Guo, Lutz Volkmann:
Tree-Ramsey numbers. Australas. J Comb. 11: 169-176 (1995) - [j17]Peter Dankelmann, Lutz Volkmann:
New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Comb. 40 (1995) - [j16]Lutz Volkmann:
On graphs with equal domination and edge independence numbers. Ars Comb. 41 (1995) - [j15]Yubao Guo, Lutz Volkmann:
A generalization of menger's theorem for certain block - cactus graphs. Graphs Comb. 11(1): 49-52 (1995) - 1994
- [j14]Bert Randerath, Lutz Volkmann:
A characterization of well covered block-cactus graphs. Australas. J Comb. 9: 307- (1994) - [j13]Lutz Volkmann:
on Graphs with Equal Domination and Covering Numbers. Discret. Appl. Math. 51(1-2): 211-217 (1994) - [j12]Werner Siemes, Jerzy Topp, Lutz Volkmann:
On unique independent sets in graphs. Discret. Math. 131(1-3): 279-285 (1994) - [j11]Yubao Guo, Lutz Volkmann:
On complementary cycles in locally semicomplete digraphs. Discret. Math. 135(1-3): 121-127 (1994) - [j10]Yubao Guo, Lutz Volkmann:
Cycles in Multipartite Tournaments. J. Comb. Theory B 62(2): 363-366 (1994) - [j9]Yubao Guo, Lutz Volkmann:
Connectivity properties of locally semicomplete digraphs. J. Graph Theory 18(3): 269-280 (1994) - 1993
- [j8]Jerzy Topp, Lutz Volkmann:
Some upper bounds for the product of the domination number and the chromatic number of a graph. Discret. Math. 118(1-3): 289-292 (1993) - [j7]Christoph Stracke, Lutz Volkmann:
A new domination conception. J. Graph Theory 17(3): 315-323 (1993) - [j6]Jerzy Topp, Lutz Volkmann:
Sufficient conditions for equality of connectivity and minimum degree of a graph. J. Graph Theory 17(6): 695-700 (1993) - 1991
- [j5]Jerzy Topp, Lutz Volkmann:
On graphs with equal domination and independent domination numbers. Discret. Math. 96(1): 75-80 (1991) - [j4]Jerzy Topp, Lutz Volkmann:
On packing and covering numbers of graphs. Discret. Math. 96(3): 229-238 (1991) - 1990
- [j3]Peter Flach, Lutz Volkmann:
Estimations for the domination number of a graph. Discret. Math. 80(2): 145-151 (1990) - [j2]Thomas Niessen, Lutz Volkmann:
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. J. Graph Theory 14(2): 225-246 (1990)
1980 – 1989
- 1989
- [j1]Lutz Volkmann:
Edge-connectivity in p-partite graphs. J. Graph Theory 13(1): 1-6 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
