Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Lutz Volkmann
@article{DBLP:journals/csjm/SheikholeslamiV23,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Total Italian domatic number of graphs},
journal = {Comput. Sci. J. Moldova},
volume = {31},
number = {2},
pages = {169--182},
year = {2023},
url = {http://www.math.md/publications/csjm/issues/v31-n2/13777/},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csjm/SheikholeslamiV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann23,
author = {Lutz Volkmann},
title = {Double Roman and double Italian domination},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {3},
pages = {721--730},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2399},
doi = {10.7151/DMGT.2399},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann22,
author = {Lutz Volkmann},
title = {Restrained Roman and restrained Italian domatic numbers of graphs},
journal = {Discret. Appl. Math.},
volume = {322},
pages = {153--159},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.07.025},
doi = {10.1016/J.DAM.2022.07.025},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChellaliRSV22,
author = {Mustapha Chellali and
Nader Jafari Rad and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The Roman domatic problem in graphs and digraphs: a survey},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {3},
pages = {861--891},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2313},
doi = {10.7151/DMGT.2313},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/ChellaliRSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/SheikholeslamiV22,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Nordhaus-Gaddum type inequalities on the total Italian domination
number in graphs},
journal = {{RAIRO} Oper. Res.},
volume = {56},
number = {4},
pages = {2235--2243},
year = {2022},
url = {https://doi.org/10.1051/ro/2022108},
doi = {10.1051/RO/2022108},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/SheikholeslamiV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/MojdehMV22,
author = {Doost Ali Mojdeh and
Iman Masoumi and
Lutz Volkmann},
title = {Restrained double Roman domination of a graph},
journal = {{RAIRO} Oper. Res.},
volume = {56},
number = {4},
pages = {2293--2304},
year = {2022},
url = {https://doi.org/10.1051/ro/2022089},
doi = {10.1051/RO/2022089},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/MojdehMV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/complexity/HongXCV21,
author = {Zhen{-}Mu Hong and
Zheng{-}Jiang Xia and
Fu{-}Yuan Chen and
Lutz Volkmann},
title = {Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected,
and Super-Connected},
journal = {Complex.},
volume = {2021},
pages = {5588146:1--5588146:11},
year = {2021},
url = {https://doi.org/10.1155/2021/5588146},
doi = {10.1155/2021/5588146},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/complexity/HongXCV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AramDSVV21,
author = {Hamideh Aram and
Nasrin Dehgardi and
Seyed Mahmoud Sheikholeslami and
Mina Valinavaz and
Lutz Volkmann},
title = {Domination, independent domination number and 2-independence number
in trees},
journal = {Discuss. Math. Graph Theory},
volume = {41},
number = {1},
pages = {39--49},
year = {2021},
url = {https://doi.org/10.7151/dmgt.2165},
doi = {10.7151/DMGT.2165},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/AramDSVV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/WangCDGSV21,
author = {Xiaolin Wang and
Yaojun Chen and
Peter Dankelmann and
Yubao Guo and
Michel Surmacs and
Lutz Volkmann},
title = {Oriented diameter of maximal outerplanar graphs},
journal = {J. Graph Theory},
volume = {98},
number = {3},
pages = {426--444},
year = {2021},
url = {https://doi.org/10.1002/jgt.22707},
doi = {10.1002/JGT.22707},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/WangCDGSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/KhoeilarKCSV21,
author = {Rana Khoeilar and
Hossein Karami and
Mustapha Chellali and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Nordhaus-Gaddum type results for connected and total domination},
journal = {{RAIRO} Oper. Res.},
volume = {55},
number = {Supplement},
pages = {S853--S862},
year = {2021},
url = {https://doi.org/10.1051/ro/2020025},
doi = {10.1051/RO/2020025},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rairo/KhoeilarKCSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/ChellaliRSV20,
author = {Mustapha Chellali and
Nader Jafari Rad and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Varieties of Roman domination {II}},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {17},
number = {3},
pages = {966--984},
year = {2020},
url = {https://doi.org/10.1016/j.akcej.2019.12.001},
doi = {10.1016/J.AKCEJ.2019.12.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/akcej/ChellaliRSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/MojdehSV20,
author = {Doost Ali Mojdeh and
Babak Samadi and
Lutz Volkmann},
title = {Nordhaus-Gaddum type inequalities for multiple domination and packing
parameters in graphs},
journal = {Contributions Discret. Math.},
volume = {15},
number = {1},
pages = {154--162},
year = {2020},
url = {https://cdm.ucalgary.ca/article/view/62630},
timestamp = {Tue, 10 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cdm/MojdehSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MojdehV20,
author = {Doost Ali Mojdeh and
Lutz Volkmann},
title = {Roman \{3\}-domination (double Italian domination)},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {555--564},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.02.001},
doi = {10.1016/J.DAM.2020.02.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MojdehV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Khoeilar0CSV20,
author = {R. Khoeilar and
Hossein Karami and
Mustapha Chellali and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {A proof of a conjecture on the differential of a subcubic graph},
journal = {Discret. Appl. Math.},
volume = {287},
pages = {27--39},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.07.018},
doi = {10.1016/J.DAM.2020.07.018},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Khoeilar0CSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Nazari-Moghaddam20,
author = {Sakineh Nazari{-}Moghaddam and
Lutz Volkmann},
title = {Critical concept for double Roman domination in graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {12},
number = {02},
pages = {2050020},
year = {2020},
url = {https://doi.org/10.1142/s1793830920500202},
doi = {10.1142/S1793830920500202},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/Nazari-Moghaddam20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann20,
author = {Lutz Volkmann},
title = {The double Roman domatic number of a digraph},
journal = {Discuss. Math. Graph Theory},
volume = {40},
number = {4},
pages = {995--1004},
year = {2020},
url = {https://doi.org/10.7151/dmgt.2161},
doi = {10.7151/DMGT.2161},
timestamp = {Fri, 24 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/ShaoMV20,
author = {Zehui Shao and
Doost Ali Mojdeh and
Lutz Volkmann},
title = {Total Roman \{3\}-domination in Graphs},
journal = {Symmetry},
volume = {12},
number = {2},
pages = {268},
year = {2020},
url = {https://doi.org/10.3390/sym12020268},
doi = {10.3390/SYM12020268},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/ShaoMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HajianRV19,
author = {Majid Hajian and
Nader Jafari Rad and
Lutz Volkmann},
title = {Bounds on the fair total domination number in trees and unicyclic
graphs},
journal = {Australas. {J} Comb.},
volume = {74},
pages = {460--475},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/74/ajc\_v74\_p460.pdf},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HajianRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann19,
author = {Lutz Volkmann},
title = {The Roman \{2\}-domatic number of graphs},
journal = {Discret. Appl. Math.},
volume = {258},
pages = {235--241},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.11.027},
doi = {10.1016/J.DAM.2018.11.027},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChenHV19,
author = {Xiaodan Chen and
Guoliang Hao and
Lutz Volkmann},
title = {Bounds on the signed Roman \emph{k}-domination number of a digraph},
journal = {Discuss. Math. Graph Theory},
volume = {39},
number = {1},
pages = {67--79},
year = {2019},
url = {https://doi.org/10.7151/dmgt.2068},
doi = {10.7151/DMGT.2068},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChenHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/LiuSSSV19,
author = {Zehui Shao and
Seyed Mahmoud Sheikholeslami and
Marzieh Soroudi and
Lutz Volkmann and
Xinmiao Liu},
title = {On the co-Roman domination in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {39},
number = {2},
pages = {455--472},
year = {2019},
url = {https://doi.org/10.7151/dmgt.2091},
doi = {10.7151/DMGT.2091},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/LiuSSSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann19,
author = {Lutz Volkmann},
title = {Sufficient conditions for maximally edge-connected and super-edge-connected
graphs depending on the clique number},
journal = {Discuss. Math. Graph Theory},
volume = {39},
number = {2},
pages = {567--573},
year = {2019},
url = {https://doi.org/10.7151/dmgt.2096},
doi = {10.7151/DMGT.2096},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MilzV18,
author = {Sebastian Milz and
Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected and super-edge-connected
digraphs depending on the clique number},
journal = {Discret. Math.},
volume = {341},
number = {2},
pages = {484--491},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.09.015},
doi = {10.1016/J.DISC.2017.09.015},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MilzV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AmjadiNSV18,
author = {Jafar Amjadi and
Sakineh Nazari{-}Moghaddam and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {An upper bound on the double Roman domination number},
journal = {J. Comb. Optim.},
volume = {36},
number = {1},
pages = {81--89},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0286-6},
doi = {10.1007/S10878-018-0286-6},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AmjadiNSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann17,
author = {Lutz Volkmann},
title = {Lower bounds on the signed k-domination number of graphs},
journal = {Ars Comb.},
volume = {135},
pages = {357--367},
year = {2017},
timestamp = {Thu, 12 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AmjadiADFSV17,
author = {Jafar Amjadi and
Leila Asgharsharghi and
Nasrin Dehgardi and
Michitaka Furuya and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The k-rainbow reinforcement numbers in graphs},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {394--404},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.09.043},
doi = {10.1016/J.DAM.2016.09.043},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AmjadiADFSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenSV17,
author = {Zhibing Chen and
Guifu Su and
Lutz Volkmann},
title = {Sufficient conditions on the zeroth-order general Randi{\'{c}}
index for maximally edge-connected graphs},
journal = {Discret. Appl. Math.},
volume = {218},
pages = {64--70},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.11.002},
doi = {10.1016/J.DAM.2016.11.002},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MengGLGV17,
author = {Wei Meng and
Jia Guo and
Mei Lu and
Yubao Guo and
Lutz Volkmann},
title = {Universal arcs in local tournaments},
journal = {Discret. Math.},
volume = {340},
number = {12},
pages = {2900--2915},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.07.025},
doi = {10.1016/J.DISC.2017.07.025},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MengGLGV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AsgharsharghiSV17,
author = {Leila Asgharsharghi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed Roman edge \emph{k}-domination in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {1},
pages = {39--53},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1912},
doi = {10.7151/DMGT.1912},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/AsgharsharghiSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann17,
author = {Lutz Volkmann},
title = {Signed total Roman domination in digraphs},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {1},
pages = {261--272},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1929},
doi = {10.7151/DMGT.1929},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann17a,
author = {Lutz Volkmann},
title = {The signed total Roman \emph{k}-domatic number of a graph},
journal = {Discuss. Math. Graph Theory},
volume = {37},
number = {4},
pages = {1027--1038},
year = {2017},
url = {https://doi.org/10.7151/dmgt.1970},
doi = {10.7151/DMGT.1970},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/MoghaddamMSV17,
author = {S. M. Hosseini Moghaddam and
Doost Ali Mojdeh and
Babak Samadi and
Lutz Volkmann},
title = {On the signed 2-independence number of graphs},
journal = {Electron. J. Graph Theory Appl.},
volume = {5},
number = {1},
pages = {36--42},
year = {2017},
url = {https://doi.org/10.5614/ejgta.2017.5.1.4},
doi = {10.5614/EJGTA.2017.5.1.4},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/MoghaddamMSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BahremandpourSV17,
author = {A. Bahremandpour and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Roman game domination number of a graph},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {713--725},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0001-4},
doi = {10.1007/S10878-016-0001-4},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BahremandpourSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/AtapourDV17,
author = {Masoud Atapour and
Nasrin Dehgardi and
Lutz Volkmann},
title = {An introduction to the twin signed total \emph{k}-domination numbers
in directed graphs},
journal = {{RAIRO} Oper. Res.},
volume = {51},
number = {4},
pages = {1331--1343},
year = {2017},
url = {https://doi.org/10.1051/ro/2017036},
doi = {10.1051/RO/2017036},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/AtapourDV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann16,
author = {Lutz Volkmann},
title = {The signed Roman k-domatic number of digraphs},
journal = {Australas. {J} Comb.},
volume = {64},
pages = {444--457},
year = {2016},
url = {http://ajc.maths.uq.edu.au/pdf/64/ajc\_v64\_p444.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/RadV16,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Total restrained reinforcement in graphs},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {13},
number = {1},
pages = {16--21},
year = {2016},
url = {https://doi.org/10.1016/j.akcej.2016.02.003},
doi = {10.1016/J.AKCEJ.2016.02.003},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/akcej/RadV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/AmjadiSV16,
author = {Jafar Amjadi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Rainbow restrained domination numbers in graphs},
journal = {Ars Comb.},
volume = {124},
pages = {3--19},
year = {2016},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/AmjadiSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/AhangarASSV16,
author = {Hossein Abdollahzadeh Ahangar and
Jafar Amjadi and
Seyed Mahmoud Sheikholeslami and
Vladimir Samodivkin and
Lutz Volkmann},
title = {On the rainbow restrained domination number},
journal = {Ars Comb.},
volume = {125},
pages = {209--224},
year = {2016},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/AhangarASSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/SheikholeslamiV16,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed (j, k)-domatic number of graphs},
journal = {Ars Comb.},
volume = {126},
pages = {73--86},
year = {2016},
timestamp = {Tue, 02 Aug 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/SheikholeslamiV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/RadV16,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Matchings in 4-total restrained domination vertex critical graphs},
journal = {Ars Comb.},
volume = {128},
pages = {415--428},
year = {2016},
timestamp = {Tue, 02 Aug 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/RadV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann16,
author = {Lutz Volkmann},
title = {On the signed total Roman domination and domatic numbers of graphs},
journal = {Discret. Appl. Math.},
volume = {214},
pages = {179--186},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.06.006},
doi = {10.1016/J.DAM.2016.06.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/MoghaddamMSV16,
author = {Seyyed Mehdi Hosseini Moghaddam and
Doost Ali Mojdeh and
Babak Samadi and
Lutz Volkmann},
title = {New bounds on the signed total domination number of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {36},
number = {2},
pages = {467--477},
year = {2016},
url = {https://doi.org/10.7151/dmgt.1871},
doi = {10.7151/DMGT.1871},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/MoghaddamMSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HenningV16,
author = {Michael A. Henning and
Lutz Volkmann},
title = {Signed Roman k-Domination in Graphs},
journal = {Graphs Comb.},
volume = {32},
number = {1},
pages = {175--190},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1536-3},
doi = {10.1007/S00373-015-1536-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HenningV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/RadV16,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Edge-Removal and Edge-Addition in {\(\alpha\)}-Domination},
journal = {Graphs Comb.},
volume = {32},
number = {3},
pages = {1155--1166},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1614-6},
doi = {10.1007/S00373-015-1614-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/RadV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Volkmann16,
author = {Lutz Volkmann},
title = {Signed Roman k-domination in Digraphs},
journal = {Graphs Comb.},
volume = {32},
number = {3},
pages = {1217--1227},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1641-3},
doi = {10.1007/S00373-015-1641-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Volkmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhangarASVZ16,
author = {Hossein Abdollahzadeh Ahangar and
Jafar Amjadi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann and
Yancai Zhao},
title = {Signed Roman edge domination numbers in graphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {1},
pages = {333--346},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9747-8},
doi = {10.1007/S10878-014-9747-8},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AhangarASVZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AhangarASV16,
author = {Hossein Abdollahzadeh Ahangar and
Leila Asgharsharghi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed mixed Roman domination numbers in graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {299--317},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9879-5},
doi = {10.1007/S10878-015-9879-5},
timestamp = {Wed, 20 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AhangarASV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Volkmann16,
author = {Lutz Volkmann},
title = {Signed total Roman domination in graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {3},
pages = {855--871},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9906-6},
doi = {10.1007/S10878-015-9906-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Volkmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/RadV16,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Generalization of the total outer-connected domination in graphs},
journal = {{RAIRO} Oper. Res.},
volume = {50},
number = {2},
pages = {233--239},
year = {2016},
url = {https://doi.org/10.1051/ro/2015016},
doi = {10.1051/RO/2015016},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/RadV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/FavaronSV15,
author = {Odile Favaron and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed k-domatic numbers of graphs},
journal = {Ars Comb.},
volume = {123},
pages = {169--184},
year = {2015},
timestamp = {Mon, 21 Sep 2015 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/FavaronSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann15,
author = {Lutz Volkmann},
title = {The signed Roman k-domatic number of a graph},
journal = {Discret. Appl. Math.},
volume = {180},
pages = {150--157},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.07.030},
doi = {10.1016/J.DAM.2014.07.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HenningV15,
author = {Michael A. Henning and
Lutz Volkmann},
title = {Signed Roman k-domination in trees},
journal = {Discret. Appl. Math.},
volume = {186},
pages = {98--105},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.01.019},
doi = {10.1016/J.DAM.2015.01.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HenningV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/SheikholeslamiV15,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed star (j, k)-domatic numbers of digraphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {7},
number = {2},
pages = {1550006:1--1550006:12},
year = {2015},
url = {https://doi.org/10.1142/S1793830915500068},
doi = {10.1142/S1793830915500068},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/SheikholeslamiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AmjadiMSV15,
author = {Jafar Amjadi and
Negar Mohammadi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The \emph{k}-rainbow bondage number of a digraph},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {2},
pages = {261--270},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1797},
doi = {10.7151/DMGT.1797},
timestamp = {Thu, 03 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/AmjadiMSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann15,
author = {Lutz Volkmann},
title = {Upper bounds on the signed total (\emph{k, k})-domatic number of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {4},
pages = {641--650},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1823},
doi = {10.7151/DMGT.1823},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KhodkarSV15,
author = {Abdollah Khodkar and
Babak Samadi and
Lutz Volkmann},
title = {On the signed (total) \emph{k}-independence number in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {4},
pages = {651--662},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1824},
doi = {10.7151/DMGT.1824},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KhodkarSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/SheikholeslamiV15,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The signed Roman domatic number of a digraph},
journal = {Electron. J. Graph Theory Appl.},
volume = {3},
number = {1},
pages = {85--93},
year = {2015},
url = {https://doi.org/10.5614/ejgta.2015.3.1.9},
doi = {10.5614/EJGTA.2015.3.1.9},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/SheikholeslamiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AtapourSV15,
author = {M. Atapour and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Global Roman Domination in Trees},
journal = {Graphs Comb.},
volume = {31},
number = {4},
pages = {813--825},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1415-3},
doi = {10.1007/S00373-014-1415-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AtapourSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SheikholeslamiV15,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed Roman domination in digraphs},
journal = {J. Comb. Optim.},
volume = {30},
number = {3},
pages = {456--467},
year = {2015},
url = {https://doi.org/10.1007/s10878-013-9648-2},
doi = {10.1007/S10878-013-9648-2},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SheikholeslamiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BlidiaBV14,
author = {Mostafa Blidia and
Ahmed Bouchou and
Lutz Volkmann},
title = {Bounds on the k-independence and k-chromatic numbers of graphs},
journal = {Ars Comb.},
volume = {113},
pages = {33--46},
year = {2014},
timestamp = {Thu, 19 Dec 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BlidiaBV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DehgardiSV14,
author = {Nasrin Dehgardi and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The k-rainbow bondage number of a graph},
journal = {Discret. Appl. Math.},
volume = {174},
pages = {133--139},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.006},
doi = {10.1016/J.DAM.2014.05.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DehgardiSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann13,
author = {Lutz Volkmann},
title = {Signed total (j, k)-domatic numbers of graphs},
journal = {Australas. {J} Comb.},
volume = {57},
pages = {39--48},
year = {2013},
url = {http://ajc.maths.uq.edu.au/pdf/57/ajc\_v57\_p039.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann13,
author = {Lutz Volkmann},
title = {Smallest regular and almost regular triangle-free graphs without perfect
matchings},
journal = {Ars Comb.},
volume = {111},
pages = {463--472},
year = {2013},
timestamp = {Mon, 03 Jun 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann13,
author = {Lutz Volkmann},
title = {Complementary cycles in almost regular multipartite tournaments, where
one cycle has length four},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2169--2177},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.006},
doi = {10.1016/J.DAM.2013.03.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RadV13,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {A note on the independent domination number in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3087--3089},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.009},
doi = {10.1016/J.DAM.2013.07.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RadV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann13,
author = {Lutz Volkmann},
title = {Bounds on the signed 2-independence number in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {33},
number = {4},
pages = {709--715},
year = {2013},
url = {https://doi.org/10.7151/dmgt.1686},
doi = {10.7151/DMGT.1686},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AramNSV13,
author = {Hamideh Aram and
S. Norouzian and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The distance Roman domination numbers of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {33},
number = {4},
pages = {717--730},
year = {2013},
url = {https://doi.org/10.7151/dmgt.1703},
doi = {10.7151/DMGT.1703},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/AramNSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/RadV13,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Roman Domination Dot-critical Graphs},
journal = {Graphs Comb.},
volume = {29},
number = {3},
pages = {527--533},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1139-1},
doi = {10.1007/S00373-012-1139-1},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/RadV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann12,
author = {Lutz Volkmann},
title = {The smallest regular graphs which are not 1-extendable},
journal = {Ars Comb.},
volume = {104},
pages = {179--184},
year = {2012},
timestamp = {Fri, 08 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann12a,
author = {Lutz Volkmann},
title = {On regular (2, q)-extendable graphs},
journal = {Ars Comb.},
volume = {105},
pages = {53--64},
year = {2012},
timestamp = {Sat, 09 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeierlingV12,
author = {Dirk Meierling and
Lutz Volkmann},
title = {Sufficient conditions for triangle-free graphs to be optimally restricted
edge-connected},
journal = {Discret. Appl. Math.},
volume = {160},
number = {12},
pages = {1775--1781},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.03.020},
doi = {10.1016/J.DAM.2012.03.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeierlingV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann12,
author = {Lutz Volkmann},
title = {Signed 2-independence in digraphs},
journal = {Discret. Math.},
volume = {312},
number = {2},
pages = {465--471},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.09.009},
doi = {10.1016/J.DISC.2011.09.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/SheikholeslamiV12,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed total \{k\}-domination and \{k\}-Domatic numbers of Graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {4},
number = {1},
year = {2012},
url = {https://doi.org/10.1142/S1793830912500061},
doi = {10.1142/S1793830912500061},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/SheikholeslamiV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/SheikholeslamiV12,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The \emph{k}-rainbow domatic number of a graph},
journal = {Discuss. Math. Graph Theory},
volume = {32},
number = {1},
pages = {129--140},
year = {2012},
url = {https://doi.org/10.7151/dmgt.1591},
doi = {10.7151/DMGT.1591},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/SheikholeslamiV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/SheikholeslamiV12a,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The total \{\emph{k}\}-domatic number of digraphs},
journal = {Discuss. Math. Graph Theory},
volume = {32},
number = {3},
pages = {461--471},
year = {2012},
url = {https://doi.org/10.7151/dmgt.1618},
doi = {10.7151/DMGT.1618},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/SheikholeslamiV12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChellaliFHV12,
author = {Mustapha Chellali and
Odile Favaron and
Adriana Hansberg and
Lutz Volkmann},
title = {k-Domination and k-Independence in Graphs: {A} Survey},
journal = {Graphs Comb.},
volume = {28},
number = {1},
pages = {1--55},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1040-3},
doi = {10.1007/S00373-011-1040-3},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChellaliFHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SheikholeslamiV12,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The total \{k\}-domatic number of a graph},
journal = {J. Comb. Optim.},
volume = {23},
number = {2},
pages = {252--260},
year = {2012},
url = {https://doi.org/10.1007/s10878-010-9352-4},
doi = {10.1007/S10878-010-9352-4},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SheikholeslamiV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HoltkampV11,
author = {Andreas Holtkamp and
Lutz Volkmann},
title = {On local connectivity of K\({}_{\mbox{2, p}}\)-free graphs},
journal = {Australas. {J} Comb.},
volume = {51},
pages = {29--40},
year = {2011},
url = {http://ajc.maths.uq.edu.au/pdf/51/ajc\_v51\_p029.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HoltkampV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HansbergV11,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {2-domination in bipartite graphs with odd independence number},
journal = {Australas. {J} Comb.},
volume = {51},
pages = {115--124},
year = {2011},
url = {http://ajc.maths.uq.edu.au/pdf/51/ajc\_v51\_p115.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HansbergV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/Volkmann11,
author = {Lutz Volkmann},
title = {Bounds on the signed domatic number},
journal = {Appl. Math. Lett.},
volume = {24},
number = {2},
pages = {196--198},
year = {2011},
url = {https://doi.org/10.1016/j.aml.2010.09.002},
doi = {10.1016/J.AML.2010.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/Volkmann11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/MeierlingSV11,
author = {Dirk Meierling and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph},
journal = {Appl. Math. Lett.},
volume = {24},
number = {10},
pages = {1758--1761},
year = {2011},
url = {https://doi.org/10.1016/j.aml.2011.04.046},
doi = {10.1016/J.AML.2011.04.046},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/MeierlingSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann11,
author = {Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected and super-edge-connected
oriented graphs depending on the clique number},
journal = {Ars Comb.},
volume = {99},
pages = {55--64},
year = {2011},
timestamp = {Thu, 07 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HansbergV11,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {On 2-domination and independence domination numbers of graphs},
journal = {Ars Comb.},
volume = {101},
pages = {405--415},
year = {2011},
timestamp = {Thu, 07 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HansbergV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/SheikholeslamiV11,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Signed star k-domatic number of a graph},
journal = {Contributions Discret. Math.},
volume = {6},
number = {2},
year = {2011},
url = {http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/270},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cdm/SheikholeslamiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann11,
author = {Lutz Volkmann},
title = {Upper bounds on the signed total domatic number of graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {8},
pages = {832--837},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.01.018},
doi = {10.1016/J.DAM.2011.01.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TarghiRV11,
author = {E. Ebrahimi Targhi and
Nader Jafari Rad and
Lutz Volkmann},
title = {Unique response Roman domination in graphs},
journal = {Discret. Appl. Math.},
volume = {159},
number = {11},
pages = {1110--1117},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.03.013},
doi = {10.1016/J.DAM.2011.03.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/TarghiRV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann11,
author = {Lutz Volkmann},
title = {Signed domination and signed domatic numbers of digraphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {3},
pages = {415--427},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1555},
doi = {10.7151/DMGT.1555},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChellaliV11,
author = {Mustapha Chellali and
Lutz Volkmann},
title = {Characterization of trees with equal 2-domination number and domination
number plus two},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {4},
pages = {687--697},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1573},
doi = {10.7151/DMGT.1573},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChellaliV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Volkmann11a,
author = {Lutz Volkmann},
title = {Connected global offensive \emph{k}-alliances in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {4},
pages = {699--707},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1574},
doi = {10.7151/DMGT.1574},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Volkmann11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/RadV11,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {Roman bondage in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {4},
pages = {763--773},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1578},
doi = {10.7151/DMGT.1578},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/RadV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/RadV11,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {On the Roman Bondage Number of Planar Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {4},
pages = {531--538},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-0978-x},
doi = {10.1007/S00373-010-0978-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/RadV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/HansbergMV11,
author = {Adriana Hansberg and
Dirk Meierling and
Lutz Volkmann},
title = {Independence and \emph{k}-domination in graphs},
journal = {Int. J. Comput. Math.},
volume = {88},
number = {5},
pages = {905--915},
year = {2011},
url = {https://doi.org/10.1080/00207160.2010.482664},
doi = {10.1080/00207160.2010.482664},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/HansbergMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann10,
author = {Lutz Volkmann},
title = {On almost 1-extendable graphs},
journal = {Australas. {J} Comb.},
volume = {47},
pages = {83--90},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/47/ajc\_v47\_p083.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ChellaliV10,
author = {Mustapha Chellali and
Lutz Volkmann},
title = {Independence and global offensive alliance in graphs},
journal = {Australas. {J} Comb.},
volume = {47},
pages = {125--132},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/47/ajc\_v47\_p125.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ChellaliV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/SheikholeslamiV10,
author = {Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {The Roman domatic number of a graph},
journal = {Appl. Math. Lett.},
volume = {23},
number = {10},
pages = {1295--1300},
year = {2010},
url = {https://doi.org/10.1016/j.aml.2010.06.016},
doi = {10.1016/J.AML.2010.06.016},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/SheikholeslamiV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann10,
author = {Lutz Volkmann},
title = {Sufficient conditions for maximally edge-connected and super-edge-connected
oriented graphs depending on the clique number},
journal = {Ars Comb.},
volume = {96},
year = {2010},
timestamp = {Thu, 07 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/DankelmannV10,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {The Diameter of Almost Eulerian Digraphs},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/429},
doi = {10.37236/429},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/DankelmannV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AtapourSGV10,
author = {M. Atapour and
Seyed Mahmoud Sheikholeslami and
Arezoo N. Ghameshlou and
Lutz Volkmann},
title = {Signed star domatic number of a graph},
journal = {Discret. Appl. Math.},
volume = {158},
number = {3},
pages = {213--218},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.09.015},
doi = {10.1016/J.DAM.2009.09.015},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AtapourSGV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MeierlingV10,
author = {Dirk Meierling and
Lutz Volkmann},
title = {Cycle factors in strongly connected local tournaments},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {850--860},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.09.025},
doi = {10.1016/J.DISC.2009.09.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MeierlingV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HansbergV10,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {On the geodetic and geodetic domination numbers of a graph},
journal = {Discret. Math.},
volume = {310},
number = {15-16},
pages = {2140--2146},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.04.013},
doi = {10.1016/J.DISC.2010.04.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HansbergV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChellaliHV10,
author = {Mustapha Chellali and
Teresa W. Haynes and
Lutz Volkmann},
title = {\emph{k}-independence stable graphs upon edge removal},
journal = {Discuss. Math. Graph Theory},
volume = {30},
number = {2},
pages = {265--274},
year = {2010},
url = {https://doi.org/10.7151/dmgt.1492},
doi = {10.7151/DMGT.1492},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChellaliHV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/HansbergMV10,
author = {Adriana Hansberg and
Dirk Meierling and
Lutz Volkmann},
title = {A general method in the theory of domination in graphs},
journal = {Int. J. Comput. Math.},
volume = {87},
number = {13},
pages = {2915--2924},
year = {2010},
url = {https://doi.org/10.1080/00207160903137167},
doi = {10.1080/00207160903137167},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/HansbergMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoltkampV10,
author = {Andreas Holtkamp and
Lutz Volkmann},
title = {On local connectivity of graphs with given clique number},
journal = {J. Graph Theory},
volume = {63},
number = {3},
pages = {192--197},
year = {2010},
url = {https://doi.org/10.1002/jgt.20419},
doi = {10.1002/JGT.20419},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoltkampV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FavaronKKSV10,
author = {Odile Favaron and
Hossein Karami and
R. Khoeilar and
Seyed Mahmoud Sheikholeslami and
Lutz Volkmann},
title = {Proof of a conjecture on game domination},
journal = {J. Graph Theory},
volume = {64},
number = {4},
pages = {323--329},
year = {2010},
url = {https://doi.org/10.1002/jgt.20459},
doi = {10.1002/JGT.20459},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FavaronKKSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HansbergV09,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {A characterization of even order trees with domination number half
their order minus one},
journal = {Australas. {J} Comb.},
volume = {44},
pages = {247--254},
year = {2009},
url = {http://ajc.maths.uq.edu.au/pdf/44/ajc\_v44\_p247.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HansbergV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ChellaliHV09,
author = {Mustapha Chellali and
Teresa W. Haynes and
Lutz Volkmann},
title = {Global offensive alliance numbers in graphs with emphasis on trees},
journal = {Australas. {J} Comb.},
volume = {45},
pages = {87--96},
year = {2009},
url = {http://ajc.maths.uq.edu.au/pdf/45/ajc\_v45\_p087.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ChellaliHV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann09,
author = {Lutz Volkmann},
title = {On regular (1, q)-extendable graphs},
journal = {Australas. {J} Comb.},
volume = {45},
pages = {207--216},
year = {2009},
url = {http://ajc.maths.uq.edu.au/pdf/45/ajc\_v45\_p207.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/Volkmann09,
author = {Lutz Volkmann},
title = {Some remarks on the signed domatic number of graphs with small minimum
degree},
journal = {Appl. Math. Lett.},
volume = {22},
number = {8},
pages = {1166--1169},
year = {2009},
url = {https://doi.org/10.1016/j.aml.2008.09.006},
doi = {10.1016/J.AML.2008.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/Volkmann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HansbergV09,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {Upper bounds on the k-domination number and the k-Roman domination
number},
journal = {Discret. Appl. Math.},
volume = {157},
number = {7},
pages = {1634--1639},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.10.011},
doi = {10.1016/J.DAM.2008.10.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HansbergV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeierlingVZ09,
author = {Dirk Meierling and
Lutz Volkmann and
Stephan Zitzen},
title = {The signed domatic number of some regular graphs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {8},
pages = {1905--1912},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.11.012},
doi = {10.1016/J.DAM.2008.11.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeierlingVZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW09,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Every cycle-connected multipartite tournament has a universal arc},
journal = {Discret. Math.},
volume = {309},
number = {4},
pages = {1013--1017},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.01.032},
doi = {10.1016/J.DISC.2008.01.032},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV09,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {On the existence of edge cuts leaving several large components},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1703--1707},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.02.014},
doi = {10.1016/J.DISC.2008.02.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MeierlingV09,
author = {Dirk Meierling and
Lutz Volkmann},
title = {On the number of cycles in local tournaments},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2042--2052},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.015},
doi = {10.1016/J.DISC.2008.04.015},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MeierlingV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McKeeV09,
author = {Terry A. McKee and
Lutz Volkmann},
title = {Parity and disparity subgraphs},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2608--2612},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.03.028},
doi = {10.1016/J.DISC.2008.03.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McKeeV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DankelmannHV09,
author = {Peter Dankelmann and
Angelika Hellwig and
Lutz Volkmann},
title = {Inverse degree and edge-connectivity},
journal = {Discret. Math.},
volume = {309},
number = {9},
pages = {2943--2947},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.06.041},
doi = {10.1016/J.DISC.2008.06.041},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DankelmannHV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HeKMVW09,
author = {Zhihong He and
Torsten Korneffel and
Dirk Meierling and
Lutz Volkmann and
Stefan Winzen},
title = {Complementary cycles in regular multipartite tournaments, where one
cycle has length five},
journal = {Discret. Math.},
volume = {309},
number = {10},
pages = {3131--3149},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.08.022},
doi = {10.1016/J.DISC.2008.08.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HeKMVW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoltkampV09,
author = {Andreas Holtkamp and
Lutz Volkmann},
title = {On the connectivity of p-diamond-free graphs},
journal = {Discret. Math.},
volume = {309},
number = {20},
pages = {6065--6069},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.05.009},
doi = {10.1016/J.DISC.2009.05.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoltkampV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChellaliHRV09,
author = {Mustapha Chellali and
Teresa W. Haynes and
Bert Randerath and
Lutz Volkmann},
title = {Bounds on the global offensive \emph{k}-alliance number in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {29},
number = {3},
pages = {597--613},
year = {2009},
url = {https://doi.org/10.7151/dmgt.1467},
doi = {10.7151/DMGT.1467},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChellaliHRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DankelmannV09,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Minimum size of a graph or digraph of given radius},
journal = {Inf. Process. Lett.},
volume = {109},
number = {16},
pages = {971--973},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.06.001},
doi = {10.1016/J.IPL.2009.06.001},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DankelmannV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/MeierlingV09,
author = {Dirk Meierling and
Lutz Volkmann},
title = {A remark on degree sequences of multigraphs},
journal = {Math. Methods Oper. Res.},
volume = {69},
number = {2},
pages = {369--374},
year = {2009},
url = {https://doi.org/10.1007/s00186-008-0265-2},
doi = {10.1007/S00186-008-0265-2},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/MeierlingV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/FujisawaHKSSV08,
author = {Jun Fujisawa and
Adriana Hansberg and
Takahiro Kubo and
Akira Saito and
Masahide Sugita and
Lutz Volkmann},
title = {A note on the 2-domination number of a tree},
journal = {Australas. {J} Comb.},
volume = {40},
pages = {265--268},
year = {2008},
url = {http://ajc.maths.uq.edu.au/pdf/40/ajc\_v40\_p265.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/FujisawaHKSSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/MeierlingVW08,
author = {Dirk Meierling and
Lutz Volkmann and
Stefan Winzen},
title = {Restricted arc-connectivity of generalized tournaments},
journal = {Australas. {J} Comb.},
volume = {40},
pages = {269--278},
year = {2008},
url = {http://ajc.maths.uq.edu.au/pdf/40/ajc\_v40\_p269.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/MeierlingVW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann08,
author = {Lutz Volkmann},
title = {A characterization of bipartite graphs with independence number half
their order},
journal = {Australas. {J} Comb.},
volume = {41},
pages = {219--222},
year = {2008},
url = {http://ajc.maths.uq.edu.au/pdf/41/ajc\_v41\_p219.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/VolkmannZ08,
author = {Lutz Volkmann and
Axel Zingsem},
title = {On the order of almost regular bipartite graphs without perfect matchings},
journal = {Australas. {J} Comb.},
volume = {42},
pages = {165--170},
year = {2008},
url = {http://ajc.maths.uq.edu.au/pdf/42/ajc\_v42\_p165.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/VolkmannZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/Volkmann08,
author = {Lutz Volkmann},
title = {On local connectivity of graphs},
journal = {Appl. Math. Lett.},
volume = {21},
number = {1},
pages = {63--66},
year = {2008},
url = {https://doi.org/10.1016/j.aml.2006.12.014},
doi = {10.1016/J.AML.2006.12.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/Volkmann08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/StellaVW08,
author = {Irene Stella and
Lutz Volkmann and
Stefan Winzen},
title = {How close to regular must a multipartite tournament be to secure a
given path covering number?},
journal = {Ars Comb.},
volume = {87},
year = {2008},
timestamp = {Wed, 26 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/StellaVW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HellwigV08,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {The connectivity of a graph and its complement},
journal = {Discret. Appl. Math.},
volume = {156},
number = {17},
pages = {3325--3328},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2008.05.012},
doi = {10.1016/J.DAM.2008.05.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HellwigV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW08,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Almost regular c-partite tournaments contain a strong subtournament
of order c when c {\textgreater}= 5},
journal = {Discret. Math.},
volume = {308},
number = {9},
pages = {1710--1721},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2006.10.019},
doi = {10.1016/J.DISC.2006.10.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MeierlingV08,
author = {Dirk Meierling and
Lutz Volkmann},
title = {All 2-connected in-tournaments that are cycle complementary},
journal = {Discret. Math.},
volume = {308},
number = {11},
pages = {2115--2133},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2006.12.008},
doi = {10.1016/J.DISC.2006.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MeierlingV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HansbergV08,
author = {Adriana Hansberg and
Lutz Volkmann},
title = {On graphs with equal domination and 2-domination numbers},
journal = {Discret. Math.},
volume = {308},
number = {11},
pages = {2277--2281},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.04.057},
doi = {10.1016/J.DISC.2007.04.057},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HansbergV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DahmeRV08,
author = {F. Dahme and
Dieter Rautenbach and
Lutz Volkmann},
title = {alpha-Domination perfect trees},
journal = {Discret. Math.},
volume = {308},
number = {15},
pages = {3187--3198},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.06.043},
doi = {10.1016/J.DISC.2007.06.043},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DahmeRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HellwigV08,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Maximally edge-connected and vertex-connected graphs and digraphs:
{A} survey},
journal = {Discret. Math.},
volume = {308},
number = {15},
pages = {3265--3296},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.06.035},
doi = {10.1016/J.DISC.2007.06.035},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HellwigV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW08a,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Strong subtournaments containing a given vertex in regular multipartite
tournaments},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5516--5521},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.006},
doi = {10.1016/J.DISC.2007.10.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV08,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {Some remarks on lambda\({}_{\mbox{p, q}}\)-connectedness},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5562--5569},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.008},
doi = {10.1016/J.DISC.2007.10.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MeierlingV08a,
author = {Dirk Meierling and
Lutz Volkmann},
title = {On arc-traceable local tournaments},
journal = {Discret. Math.},
volume = {308},
number = {24},
pages = {6513--6526},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.12.042},
doi = {10.1016/J.DISC.2007.12.042},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MeierlingV08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KorneffelMV08,
author = {Torsten Korneffel and
Dirk Meierling and
Lutz Volkmann},
title = {A remark on the (2, 2)-domination number},
journal = {Discuss. Math. Graph Theory},
volume = {28},
number = {2},
pages = {361--366},
year = {2008},
url = {https://doi.org/10.7151/dmgt.1411},
doi = {10.7151/DMGT.1411},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KorneffelMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FavaronHV08,
author = {Odile Favaron and
Adriana Hansberg and
Lutz Volkmann},
title = {On \emph{k}-domination and minimum degree in graphs},
journal = {J. Graph Theory},
volume = {57},
number = {1},
pages = {33--40},
year = {2008},
url = {https://doi.org/10.1002/jgt.20279},
doi = {10.1002/JGT.20279},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FavaronHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RautenbachV08,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {Cyclic sums, network sharing, and restricted edge cuts in graphs with
long cycles},
journal = {Networks},
volume = {52},
number = {4},
pages = {252--255},
year = {2008},
url = {https://doi.org/10.1002/net.20243},
doi = {10.1002/NET.20243},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RautenbachV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/0001JV07,
author = {S. Arumugam and
K. Jacob and
Lutz Volkmann},
title = {Total and connected domination in digraphs},
journal = {Australas. {J} Comb.},
volume = {39},
pages = {283--292},
year = {2007},
url = {http://ajc.maths.uq.edu.au/pdf/39/ajc\_v39\_p283.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/0001JV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/MeierlingV07,
author = {Dirk Meierling and
Lutz Volkmann},
title = {On the number of nonseparating vertices in strongly connected local
tournaments},
journal = {Australas. {J} Comb.},
volume = {39},
pages = {301},
year = {2007},
url = {http://ajc.maths.uq.edu.au/pdf/39/ajc\_v39\_p301.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/MeierlingV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/RautenbachV07,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {New bounds on the \emph{k}-domination number and the \emph{k}-tuple
domination number},
journal = {Appl. Math. Lett.},
volume = {20},
number = {1},
pages = {98--102},
year = {2007},
url = {https://doi.org/10.1016/j.aml.2006.03.006},
doi = {10.1016/J.AML.2006.03.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/RautenbachV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/Volkmann07,
author = {Lutz Volkmann},
title = {A remark on cycles through an arc in strongly connected multipartite
tournaments},
journal = {Appl. Math. Lett.},
volume = {20},
number = {11},
pages = {1148--1150},
year = {2007},
url = {https://doi.org/10.1016/j.aml.2006.09.014},
doi = {10.1016/J.AML.2006.09.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/Volkmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/DankelmannV07,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Average distance in bipartite tournaments},
journal = {Ars Comb.},
volume = {83},
year = {2007},
timestamp = {Fri, 28 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/DankelmannV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/KlinkenbergV07,
author = {Sabine Klinkenberg and
Lutz Volkmann},
title = {On the order of close to regular graphs without a matching of given
size},
journal = {Ars Comb.},
volume = {85},
year = {2007},
timestamp = {Fri, 28 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/KlinkenbergV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HansbergMV07,
author = {Adriana Hansberg and
Dirk Meierling and
Lutz Volkmann},
title = {Distance Domination and Distance Irredundance in Graphs},
journal = {Electron. J. Comb.},
volume = {14},
number = {1},
year = {2007},
url = {https://doi.org/10.37236/953},
doi = {10.37236/953},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HansbergMV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Volkmann07,
author = {Lutz Volkmann},
title = {A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs},
journal = {Electron. J. Comb.},
volume = {14},
number = {1},
year = {2007},
url = {https://doi.org/10.37236/1011},
doi = {10.37236/1011},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Volkmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DankelmannHV07,
author = {Peter Dankelmann and
Angelika Hellwig and
Lutz Volkmann},
title = {On the connectivity of diamond-free graphs},
journal = {Discret. Appl. Math.},
volume = {155},
number = {16},
pages = {2111--2117},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.05.010},
doi = {10.1016/J.DAM.2007.05.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DankelmannHV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann07,
author = {Lutz Volkmann},
title = {Multipartite tournaments: {A} survey},
journal = {Discret. Math.},
volume = {307},
number = {24},
pages = {3097--3129},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2007.03.053},
doi = {10.1016/J.DISC.2007.03.053},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann07a,
author = {Lutz Volkmann},
title = {Local-edge-connectivity in digraphs and oriented graphs},
journal = {Discret. Math.},
volume = {307},
number = {24},
pages = {3207--3212},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2007.03.051},
doi = {10.1016/J.DISC.2007.03.051},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/StellaVW07,
author = {Irene Stella and
Lutz Volkmann and
Stefan Winzen},
title = {Strongly 4-path-connectivity in almost regular multipartite tournaments},
journal = {Discret. Math.},
volume = {307},
number = {24},
pages = {3213--3219},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2007.03.048},
doi = {10.1016/J.DISC.2007.03.048},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/StellaVW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/PastorV07,
author = {Adriana Hansberg Pastor and
Lutz Volkmann},
title = {Characterization of block graphs with equal 2-domination number and
domination number plus one},
journal = {Discuss. Math. Graph Theory},
volume = {27},
number = {1},
pages = {93--103},
year = {2007},
url = {https://doi.org/10.7151/dmgt.1347},
doi = {10.7151/DMGT.1347},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/PastorV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Volkmann07,
author = {Lutz Volkmann},
title = {Restricted arc-connectivity of digraphs},
journal = {Inf. Process. Lett.},
volume = {103},
number = {6},
pages = {234--239},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.04.004},
doi = {10.1016/J.IPL.2007.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Volkmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KlinkenbergV06,
author = {Sabine Klinkenberg and
Lutz Volkmann},
title = {On the order of almost regular graphs without a matching of given
size},
journal = {Australas. {J} Comb.},
volume = {34},
pages = {187--194},
year = {2006},
url = {http://ajc.maths.uq.edu.au/pdf/34/ajc\_v34\_p187.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KlinkenbergV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KupperV06,
author = {Beate K{\"{u}}pper and
Lutz Volkmann},
title = {Upper bounds on the domination number of a graph in terms of order,
diameter and minimum degree},
journal = {Australas. {J} Comb.},
volume = {35},
pages = {133--140},
year = {2006},
url = {http://ajc.maths.uq.edu.au/pdf/35/ajc\_v35\_p133.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KupperV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/Volkmann06,
author = {Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected oriented graphs},
journal = {Appl. Math. Lett.},
volume = {19},
number = {11},
pages = {1255--1260},
year = {2006},
url = {https://doi.org/10.1016/j.aml.2006.01.011},
doi = {10.1016/J.AML.2006.01.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/Volkmann06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann06,
author = {Lutz Volkmann},
title = {Upper bounds on the domination number of a graph in terms of order
and minimum degree},
journal = {Ars Comb.},
volume = {81},
year = {2006},
timestamp = {Fri, 28 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VolkmannW06,
author = {Lutz Volkmann and
Stefan Winzen},
title = {On the connectivity of close to regular multipartite tournaments},
journal = {Discret. Appl. Math.},
volume = {154},
number = {9},
pages = {1437--1452},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2004.09.022},
doi = {10.1016/J.DAM.2004.09.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VolkmannW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann06,
author = {Lutz Volkmann},
title = {On cycles in regular 3-partite tournaments},
journal = {Discret. Math.},
volume = {306},
number = {12},
pages = {1198--1206},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.11.028},
doi = {10.1016/J.DISC.2005.11.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BlidiaCV06,
author = {Mostafa Blidia and
Mustapha Chellali and
Lutz Volkmann},
title = {Some bounds on the p-domination number in trees},
journal = {Discret. Math.},
volume = {306},
number = {17},
pages = {2031--2037},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.04.010},
doi = {10.1016/J.DISC.2006.04.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BlidiaCV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW06,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Paths with a given number of vertices from each partite set in regular
multipartite tournaments},
journal = {Discret. Math.},
volume = {306},
number = {21},
pages = {2724--2732},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.04.029},
doi = {10.1016/J.DISC.2006.04.029},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann06a,
author = {Lutz Volkmann},
title = {Longest cycles in almost regular 3-partite tournaments},
journal = {Discret. Math.},
volume = {306},
number = {22},
pages = {2931--2942},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.04.030},
doi = {10.1016/J.DISC.2006.04.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HoffmannSV06,
author = {Arne Hoffmann and
Elzbieta Sidorowicz and
Lutz Volkmann},
title = {Extremal bipartite graphs with a unique k-factor},
journal = {Discuss. Math. Graph Theory},
volume = {26},
number = {2},
pages = {181--192},
year = {2006},
url = {https://doi.org/10.7151/dmgt.1311},
doi = {10.7151/DMGT.1311},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HoffmannSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/PoschenV06,
author = {Michael Poschen and
Lutz Volkmann},
title = {A lower bound for the irredundance number of trees},
journal = {Discuss. Math. Graph Theory},
volume = {26},
number = {2},
pages = {209--215},
year = {2006},
url = {https://doi.org/10.7151/dmgt.1313},
doi = {10.7151/DMGT.1313},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/PoschenV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HellwigV06,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Lower bounds on the vertex-connectivity of digraphs and graphs},
journal = {Inf. Process. Lett.},
volume = {99},
number = {2},
pages = {41--46},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.03.001},
doi = {10.1016/J.IPL.2006.03.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HellwigV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jat/ButzerV06,
author = {Paul L. Butzer and
Lutz Volkmann},
title = {Otto Blumenthal {(1876-1944)} in retrospect},
journal = {J. Approx. Theory},
volume = {138},
number = {1},
pages = {1--36},
year = {2006},
url = {https://doi.org/10.1016/j.jat.2005.09.013},
doi = {10.1016/J.JAT.2005.09.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jat/ButzerV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HellwigV06,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {On connectivity in graphs with given clique number},
journal = {J. Graph Theory},
volume = {52},
number = {1},
pages = {7--14},
year = {2006},
url = {https://doi.org/10.1002/jgt.20143},
doi = {10.1002/JGT.20143},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HellwigV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/VolkmanW05,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Almost regular c-partite tournaments with c {\(\geq\)} 8 contain an
n-cycle through a given arc for 4 {\(\leq\)} n {\(\leq\)} c},
journal = {Australas. {J} Comb.},
volume = {31},
pages = {61--84},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/31/ajc\_v31\_p061.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/VolkmanW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann05,
author = {Lutz Volkmann},
title = {Complementary cycles in regular multipartite tournaments},
journal = {Australas. {J} Comb.},
volume = {31},
pages = {119--134},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/31/ajc\_v31\_p119.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HellwigV05,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Neighborhood conditions for graphs and digraphs to be maximally edge-connected},
journal = {Australas. {J} Comb.},
volume = {33},
pages = {265--278},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/33/ajc\_v33\_p265.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HellwigV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/FischermannRV05,
author = {Miranca Fischermann and
Dieter Rautenbach and
Lutz Volkmann},
title = {Extremal Trees with Respect to Dominance Order},
journal = {Ars Comb.},
volume = {76},
year = {2005},
timestamp = {Tue, 23 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/FischermannRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/DankelmannV05,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Average distance in k-connected tournaments},
journal = {Ars Comb.},
volume = {77},
year = {2005},
timestamp = {Tue, 23 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/DankelmannV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FischermannVR05,
author = {Miranca Fischermann and
Lutz Volkmann and
Dieter Rautenbach},
title = {A note on the number of matchings and independent sets in trees},
journal = {Discret. Appl. Math.},
volume = {145},
number = {3},
pages = {483--489},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.07.001},
doi = {10.1016/J.DAM.2004.07.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FischermannVR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VolkmannZ05,
author = {Lutz Volkmann and
Bohdan Zelinka},
title = {Signed domatic number of a graph},
journal = {Discret. Appl. Math.},
volume = {150},
number = {1-3},
pages = {261--267},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.08.010},
doi = {10.1016/J.DAM.2004.08.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VolkmannZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HellwigRV05,
author = {Angelika Hellwig and
Dieter Rautenbach and
Lutz Volkmann},
title = {Cuts leaving components of given minimum order},
journal = {Discret. Math.},
volume = {292},
number = {1-3},
pages = {55--65},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.11.004},
doi = {10.1016/J.DISC.2004.11.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HellwigRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FischermannVZ05,
author = {Miranca Fischermann and
Lutz Volkmann and
Igor E. Zverovich},
title = {Unique irredundance, domination and independent domination in graphs},
journal = {Discret. Math.},
volume = {305},
number = {1-3},
pages = {190--200},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.08.005},
doi = {10.1016/J.DISC.2005.08.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FischermannVZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BlidiaCV05,
author = {Mostafa Blidia and
Mustapha Chellali and
Lutz Volkmann},
title = {On the p-domination number of cactus graphs},
journal = {Discuss. Math. Graph Theory},
volume = {25},
number = {3},
pages = {355--361},
year = {2005},
url = {https://doi.org/10.7151/dmgt.1288},
doi = {10.7151/DMGT.1288},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BlidiaCV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/HoffmannV05,
author = {Arne Hoffmann and
Lutz Volkmann},
title = {Structural Remarks on Bipartite Graphs with Unique \emph{f}-Factors},
journal = {Graphs Comb.},
volume = {21},
number = {4},
pages = {421--425},
year = {2005},
url = {https://doi.org/10.1007/s00373-005-0631-2},
doi = {10.1007/S00373-005-0631-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/HoffmannV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HellwigV05,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected,
and maximally edge-connected},
journal = {J. Graph Theory},
volume = {48},
number = {3},
pages = {228--246},
year = {2005},
url = {https://doi.org/10.1002/jgt.20053},
doi = {10.1002/JGT.20053},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HellwigV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann04,
author = {Lutz Volkmann},
title = {On the size of odd order graphs with no almost perfect matching},
journal = {Australas. {J} Comb.},
volume = {29},
pages = {119--126},
year = {2004},
url = {http://ajc.maths.uq.edu.au/pdf/29/ajc\_v29\_p119.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HellwigV04,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Maximally local-edge-connected graphs and digraphs},
journal = {Ars Comb.},
volume = {72},
year = {2004},
timestamp = {Fri, 27 May 2005 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/HellwigV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Volkmann04,
author = {Lutz Volkmann},
title = {The Maximum Size Of Graphs With {A} Unique \emph{k}- Factor},
journal = {Comb.},
volume = {24},
number = {3},
pages = {531--540},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0032-9},
doi = {10.1007/S00493-004-0032-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Volkmann04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HoffmannV04,
author = {Arne Hoffmann and
Lutz Volkmann},
title = {On Regular Factors in Regular Graphs with Small Radius},
journal = {Electron. J. Comb.},
volume = {11},
number = {1},
year = {2004},
url = {https://doi.org/10.37236/1760},
doi = {10.37236/1760},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HoffmannV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChellaliV04,
author = {Mustapha Chellali and
Lutz Volkmann},
title = {Relations between the lower domination parameters and the chromatic
number of a graph},
journal = {Discret. Math.},
volume = {274},
number = {1-3},
pages = {1--8},
year = {2004},
url = {https://doi.org/10.1016/S0012-365X(03)00093-1},
doi = {10.1016/S0012-365X(03)00093-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChellaliV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoffmannV04,
author = {Arne Hoffmann and
Lutz Volkmann},
title = {On unique \emph{k}-factors and unique [1, \emph{k}]-factors in graphs},
journal = {Discret. Math.},
volume = {278},
number = {1-3},
pages = {127--138},
year = {2004},
url = {https://doi.org/10.1016/S0012-365X(03)00248-6},
doi = {10.1016/S0012-365X(03)00248-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoffmannV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann04,
author = {Lutz Volkmann},
title = {All regular multipartite tournaments that are cycle complementary},
journal = {Discret. Math.},
volume = {281},
number = {1-3},
pages = {255--266},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.09.012},
doi = {10.1016/J.DISC.2003.09.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannY04,
author = {Lutz Volkmann and
Anders Yeo},
title = {Hamiltonian paths, containing a given path or collection of arcs,
in close to regular multipartite tournaments},
journal = {Discret. Math.},
volume = {281},
number = {1-3},
pages = {267--276},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.07.013},
doi = {10.1016/J.DISC.2003.07.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HellwigV04,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Sufficient conditions for lambda'-optimality in graphs of diameter
2},
journal = {Discret. Math.},
volume = {283},
number = {1-3},
pages = {113--120},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.01.008},
doi = {10.1016/J.DISC.2004.01.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HellwigV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW04,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Cycles through a given arc and certain partite sets in almost regular
multipartite tournaments},
journal = {Discret. Math.},
volume = {283},
number = {1-3},
pages = {217--229},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.02.010},
doi = {10.1016/J.DISC.2004.02.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PetersV04,
author = {Christian Peters and
Lutz Volkmann},
title = {Vertex 6-pancyclic in-tournaments},
journal = {Discret. Math.},
volume = {285},
number = {1-3},
pages = {227--238},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.03.010},
doi = {10.1016/J.DISC.2004.03.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PetersV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannW04a,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Almost regular multipartite tournaments containing a Hamiltonian path
through a given arc},
journal = {Discret. Math.},
volume = {285},
number = {1-3},
pages = {267--278},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.04.009},
doi = {10.1016/J.DISC.2004.04.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/VolkmannW04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann04a,
author = {Lutz Volkmann},
title = {Hamiltonian paths containing a given arc, in almost regular bipartite
tournaments},
journal = {Discret. Math.},
volume = {285},
number = {1-3},
pages = {359--364},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.02.016},
doi = {10.1016/J.DISC.2004.02.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann04b,
author = {Lutz Volkmann},
title = {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]},
journal = {Discret. Math.},
volume = {287},
number = {1-3},
pages = {193--194},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.07.008},
doi = {10.1016/J.DISC.2004.07.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann04b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/DahmeRV04,
author = {F. Dahme and
Dieter Rautenbach and
Lutz Volkmann},
title = {Some remarks on alpha-domination},
journal = {Discuss. Math. Graph Theory},
volume = {24},
number = {3},
pages = {423--430},
year = {2004},
url = {https://doi.org/10.7151/dmgt.1241},
doi = {10.7151/DMGT.1241},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/DahmeRV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GuoV04,
author = {Yubao Guo and
Lutz Volkmann},
title = {Extendable Cycles in Multipartite Tournaments},
journal = {Graphs Comb.},
volume = {20},
number = {2},
pages = {185--190},
year = {2004},
url = {https://doi.org/10.1007/s00373-003-0548-6},
doi = {10.1007/S00373-003-0548-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GuoV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HellwigRV04,
author = {Angelika Hellwig and
Dieter Rautenbach and
Lutz Volkmann},
title = {Note on the connectivity of line graphs},
journal = {Inf. Process. Lett.},
volume = {91},
number = {1},
pages = {7--10},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.03.013},
doi = {10.1016/J.IPL.2004.03.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HellwigRV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HellwigV03,
author = {Angelika Hellwig and
Lutz Volkmann},
title = {Maximally edge-connected digraphs},
journal = {Australas. {J} Comb.},
volume = {27},
pages = {23--32},
year = {2003},
url = {http://ajc.maths.uq.edu.au/pdf/27/ajc\_v27\_p023.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HellwigV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/VolkmannW03,
author = {Lutz Volkmann and
Stefan Winzen},
title = {Cycles through a given arc in almost regular multipartite tournaments},
journal = {Australas. {J} Comb.},
volume = {27},
pages = {223--246},
year = {2003},
url = {http://ajc.maths.uq.edu.au/pdf/27/ajc\_v27\_p223.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/VolkmannW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BongardHV03,
author = {Kerstin Bongard and
Arne Hoffmann and
Lutz Volkmann},
title = {Minimum degree conditions for the Overfull Conjecture for odd order
graphs},
journal = {Australas. {J} Comb.},
volume = {28},
pages = {121--130},
year = {2003},
url = {http://ajc.maths.uq.edu.au/pdf/28/ajc\_v28\_p121.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BongardHV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/UeffingV03,
author = {Nicola Ueffing and
Lutz Volkmann},
title = {Restricted edge-connectivity and minimum edge-degree},
journal = {Ars Comb.},
volume = {66},
year = {2003},
timestamp = {Thu, 27 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/UeffingV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann03,
author = {Lutz Volkmann},
title = {Degree sequence conditions for super-edge-connected graphs and digraphs},
journal = {Ars Comb.},
volume = {67},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann03a,
author = {Lutz Volkmann},
title = {Cycles of length four through a given arc in almost regular multipartite
tournaments},
journal = {Ars Comb.},
volume = {68},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FischermannHRV03,
author = {Miranca Fischermann and
Arne Hoffmann and
Dieter Rautenbach and
Lutz Volkmann},
title = {A Linear-programming Approach to the Generalized Randic Index},
journal = {Discret. Appl. Math.},
volume = {128},
number = {2-3},
pages = {375--385},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00500-0},
doi = {10.1016/S0166-218X(02)00500-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FischermannHRV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FischermannRV03,
author = {Miranca Fischermann and
Dieter Rautenbach and
Lutz Volkmann},
title = {Remarks on the bondage number of planar graphs},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {57--67},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00449-1},
doi = {10.1016/S0012-365X(02)00449-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FischermannRV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FischermannRV03a,
author = {Miranca Fischermann and
Dieter Rautenbach and
Lutz Volkmann},
title = {Maximum graphs with a unique minimum dominating set},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {197--203},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00670-2},
doi = {10.1016/S0012-365X(02)00670-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FischermannRV03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV03a,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {Extremal subgraphs with respect to vertex degree bounds},
journal = {Discret. Math.},
volume = {263},
number = {1-3},
pages = {297--303},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00772-0},
doi = {10.1016/S0012-365X(02)00772-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV03,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {On alpha\({}_{\mbox{r}}\)gamma\({}_{\mbox{s}}\)(\emph{k})-perfect
graphs},
journal = {Discret. Math.},
volume = {270},
number = {1-3},
pages = {240--249},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00836-1},
doi = {10.1016/S0012-365X(02)00836-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Volkmann03,
author = {Lutz Volkmann},
title = {Degree sequence conditions for equal edge-connectivity and minimum
degree, depending on the clique number},
journal = {J. Graph Theory},
volume = {42},
number = {3},
pages = {234--245},
year = {2003},
url = {https://doi.org/10.1002/jgt.10087},
doi = {10.1002/JGT.10087},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Volkmann03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/FischermannV02,
author = {Miranca Fischermann and
Lutz Volkmann},
title = {Unique minimum domination in trees},
journal = {Australas. {J} Comb.},
volume = {25},
pages = {117--124},
year = {2002},
url = {http://ajc.maths.uq.edu.au/pdf/25/ajc-v25-p117.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/FischermannV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann02,
author = {Lutz Volkmann},
title = {Cycles through a given arc in certain almost regular multipartite
tournaments},
journal = {Australas. {J} Comb.},
volume = {26},
pages = {121--134},
year = {2002},
url = {http://ajc.maths.uq.edu.au/pdf/26/ajc\_v26\_p121.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FischermannV02,
author = {Miranca Fischermann and
Lutz Volkmann},
title = {Graphs having distance-n domination number half their order},
journal = {Discret. Appl. Math.},
volume = {120},
number = {1-3},
pages = {97--107},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00284-0},
doi = {10.1016/S0166-218X(01)00284-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FischermannV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RanderathSTV02,
author = {Bert Randerath and
Ingo Schiermeyer and
Meike Tewes and
Lutz Volkmann},
title = {Vertex pancyclic graphs},
journal = {Discret. Appl. Math.},
volume = {120},
number = {1-3},
pages = {219--237},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00292-X},
doi = {10.1016/S0166-218X(01)00292-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RanderathSTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FischermannHRSV02,
author = {Miranca Fischermann and
Arne Hoffmann and
Dieter Rautenbach and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Lutz Volkmann},
title = {Wiener index versus maximum degree in trees},
journal = {Discret. Appl. Math.},
volume = {122},
number = {1-3},
pages = {127--137},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00357-2},
doi = {10.1016/S0166-218X(01)00357-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FischermannHRSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TewesVY02,
author = {Meike Tewes and
Lutz Volkmann and
Anders Yeo},
title = {Almost all almost regular \emph{c}-partite tournaments with \emph{c}geq5
are vertex pancyclic},
journal = {Discret. Math.},
volume = {242},
number = {1-3},
pages = {201--228},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00212-6},
doi = {10.1016/S0012-365X(01)00212-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TewesVY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann02a,
author = {Lutz Volkmann},
title = {Cycles in multipartite tournaments: results and problems},
journal = {Discret. Math.},
volume = {245},
number = {1-3},
pages = {19--53},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00419-8},
doi = {10.1016/S0012-365X(01)00419-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DankelmannRV02,
author = {Peter Dankelmann and
Dieter Rautenbach and
Lutz Volkmann},
title = {Weighted domination in triangle-free graphs},
journal = {Discret. Math.},
volume = {250},
number = {1-3},
pages = {233--239},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00420-4},
doi = {10.1016/S0012-365X(01)00420-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DankelmannRV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/VolkmannZ02,
author = {Lutz Volkmann and
Vadim E. Zverovich},
title = {A disproof of Henning's conjecture on irredundance perfect graphs},
journal = {Discret. Math.},
volume = {254},
number = {1-3},
pages = {539--554},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00300-4},
doi = {10.1016/S0012-365X(01)00300-4},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/VolkmannZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BonsmaUV02,
author = {Paul S. Bonsma and
Nicola Ueffing and
Lutz Volkmann},
title = {Edge-cuts leaving components of order at least three},
journal = {Discret. Math.},
volume = {256},
number = {1-2},
pages = {431--439},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00385-0},
doi = {10.1016/S0012-365X(02)00385-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BonsmaUV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann02,
author = {Lutz Volkmann},
title = {Longest paths through an arc in strong semicomplete multipartite digraphs},
journal = {Discret. Math.},
volume = {258},
number = {1-3},
pages = {331--337},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00401-6},
doi = {10.1016/S0012-365X(02)00401-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV02,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {Independent domination and matchings in graphs},
journal = {Discret. Math.},
volume = {259},
number = {1-3},
pages = {325--330},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00304-7},
doi = {10.1016/S0012-365X(02)00304-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RautenbachV02,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {How local irregularity gets global in a graph},
journal = {J. Graph Theory},
volume = {41},
number = {1},
pages = {18--23},
year = {2002},
url = {https://doi.org/10.1002/jgt.10043},
doi = {10.1002/JGT.10043},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RautenbachV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/VolkmannZ02,
author = {Lutz Volkmann and
Vadim E. Zverovich},
title = {Proof of a conjecture on irredundance perfect graphs},
journal = {J. Graph Theory},
volume = {41},
number = {4},
pages = {292--306},
year = {2002},
url = {https://doi.org/10.1002/jgt.10068},
doi = {10.1002/JGT.10068},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/VolkmannZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann01,
author = {Lutz Volkmann},
title = {Spanning multipartite tournaments of semicomplete multipartite digraphs},
journal = {Ars Comb.},
volume = {58},
year = {2001},
timestamp = {Fri, 12 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TewesV01,
author = {Meike Tewes and
Lutz Volkmann},
title = {The ratio of the longest cycle and longest path in semicomplete multipartite
digraphs},
journal = {Discret. Math.},
volume = {231},
number = {1-3},
pages = {453--457},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00338-1},
doi = {10.1016/S0012-365X(00)00338-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TewesV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DohmenRV01,
author = {Lothar Dohmen and
Dieter Rautenbach and
Lutz Volkmann},
title = {i gamma(1)-perfect graphs},
journal = {Discret. Math.},
volume = {234},
number = {1-3},
pages = {133--138},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00396-4},
doi = {10.1016/S0012-365X(00)00396-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DohmenRV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TewesV01,
author = {Meike Tewes and
Lutz Volkmann},
title = {Vertex pancyclic in-tournaments},
journal = {J. Graph Theory},
volume = {36},
number = {2},
pages = {84--104},
year = {2001},
url = {https://doi.org/10.1002/1097-0118(200102)36:2\&\#60;84::AID-JGT4\&\#62;3.0.CO;2-D},
doi = {10.1002/1097-0118(200102)36:2\&\#60;84::AID-JGT4\&\#62;3.0.CO;2-D},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TewesV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann00,
author = {Lutz Volkmann},
title = {Longest paths through an arc in strongly connected in-tournaments},
journal = {Australas. {J} Comb.},
volume = {21},
pages = {95--106},
year = {2000},
url = {http://ajc.maths.uq.edu.au/pdf/21/ocr-ajc-v21-p95.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DankelmannV00,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected graphs depending
on the clique number},
journal = {Discret. Math.},
volume = {211},
pages = {217--223},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00279-4},
doi = {10.1016/S0012-365X(99)00279-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DankelmannV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuoTVY00,
author = {Yubao Guo and
Meike Tewes and
Lutz Volkmann and
Anders Yeo},
title = {Sufficient conditions for semicomplete multipartite digraphs to be
Hamiltonian},
journal = {Discret. Math.},
volume = {212},
number = {1-2},
pages = {91--100},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00211-3},
doi = {10.1016/S0012-365X(99)00211-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GuoTVY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DohmenRV00,
author = {Lothar Dohmen and
Dieter Rautenbach and
Lutz Volkmann},
title = {A characterization of rho alpha(\emph{k})-perfect graphs},
journal = {Discret. Math.},
volume = {224},
number = {1-3},
pages = {265--271},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00137-0},
doi = {10.1016/S0012-365X(00)00137-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DohmenRV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DankelmannRV00,
author = {Peter Dankelmann and
Dieter Rautenbach and
Lutz Volkmann},
title = {Some results on graph parameters in weighted graphs},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {85--88},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80132-5},
doi = {10.1016/S1571-0653(05)80132-5},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DankelmannRV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FischermannV00,
author = {Miranca Fischermann and
Lutz Volkmann},
title = {Graphs with unique dominating sets},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {123--125},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80142-8},
doi = {10.1016/S1571-0653(05)80142-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FischermannV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/Volkmann99,
author = {Lutz Volkmann},
title = {Strong subtournaments of multipartite tournaments},
journal = {Australas. {J} Comb.},
volume = {20},
pages = {189--196},
year = {1999},
url = {http://ajc.maths.uq.edu.au/pdf/20/ocr-ajc-v20-p189.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/Volkmann99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TewesV99,
author = {Meike Tewes and
Lutz Volkmann},
title = {Vertex deletion and cycles in multipartite tournaments},
journal = {Discret. Math.},
volume = {197-198},
pages = {769--779},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)90145-0},
doi = {10.1016/S0012-365X(99)90145-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TewesV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann99,
author = {Lutz Volkmann},
title = {Longest paths in semicomplete multipartite digraphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {279--284},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00301-X},
doi = {10.1016/S0012-365X(98)00301-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FischermannV99,
author = {Miranca Fischermann and
Lutz Volkmann},
title = {Graphs having distance-n domination number half their order},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {51--54},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80022-8},
doi = {10.1016/S1571-0653(05)80022-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FischermannV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HoffmannRV99,
author = {Arne Hoffmann and
Bert Randerath and
Lutz Volkmann},
title = {Maximal Sets of 2-Factors in Complete Equipartite Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {82--85},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80029-0},
doi = {10.1016/S1571-0653(05)80029-0},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HoffmannRV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RanderathVST99,
author = {Bert Randerath and
Lutz Volkmann and
Ingo Schiermeyer and
Meike Tewes},
title = {Vertex Pancyclic Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {166--170},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80048-4},
doi = {10.1016/S1571-0653(05)80048-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RanderathVST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/RautenbachV98,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {Some structural results on linear arboricity},
journal = {Australas. {J} Comb.},
volume = {17},
pages = {267--274},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/17/ocr-ajc-v17-p267.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/RautenbachV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/TewesV98,
author = {Meike Tewes and
Lutz Volkmann},
title = {On the cycle structure of in-tournaments},
journal = {Australas. {J} Comb.},
volume = {18},
pages = {293--302},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/18/ocr-ajc-v18-p293.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/TewesV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann98,
author = {Lutz Volkmann},
title = {The ratio of the irredundance and domination number of a graph},
journal = {Discret. Math.},
volume = {178},
number = {1-3},
pages = {221--228},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)81829-8},
doi = {10.1016/S0012-365X(97)81829-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachV98,
author = {Dieter Rautenbach and
Lutz Volkmann},
title = {The domatic number of block-cactus graphs},
journal = {Discret. Math.},
volume = {187},
number = {1-3},
pages = {185--193},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00234-3},
doi = {10.1016/S0012-365X(97)00234-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RanderathV98,
author = {Bert Randerath and
Lutz Volkmann},
title = {Characterization of graphs with equal domination and covering number},
journal = {Discret. Math.},
volume = {191},
number = {1-3},
pages = {159--169},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(98)00103-4},
doi = {10.1016/S0012-365X(98)00103-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RanderathV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/RanderathV97,
author = {Bert Randerath and
Lutz Volkmann},
title = {Simplicial Graphs and Relationships to Different Graph Invariants},
journal = {Ars Comb.},
volume = {46},
year = {1997},
timestamp = {Thu, 15 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/RanderathV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuoV97,
author = {Yubao Guo and
Lutz Volkmann},
title = {Bypaths in Tournaments},
journal = {Discret. Appl. Math.},
volume = {79},
number = {1-3},
pages = {127--135},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00038-3},
doi = {10.1016/S0166-218X(97)00038-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuoV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuoPV97,
author = {Yubao Guo and
Axel Pinkernell and
Lutz Volkmann},
title = {On cycles through a given vertex in multipartite tournaments},
journal = {Discret. Math.},
volume = {164},
number = {1-3},
pages = {165--170},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00048-9},
doi = {10.1016/S0012-365X(96)00048-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GuoPV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bang-JensenGGV97,
author = {J{\o}rgen Bang{-}Jensen and
Yubao Guo and
Gregory Z. Gutin and
Lutz Volkmann},
title = {A classification of locally semicomplete digraphs},
journal = {Discret. Math.},
volume = {167-168},
pages = {101--114},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00219-1},
doi = {10.1016/S0012-365X(96)00219-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Bang-JensenGGV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DankelmannV97,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {Degree sequence conditions for maximally edge-connected graphs and
digraphs},
journal = {J. Graph Theory},
volume = {26},
number = {1},
pages = {27--34},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199709)26:1\&\#60;27::AID-JGT4\&\#62;3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0118(199709)26:1\&\#60;27::AID-JGT4\&\#62;3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DankelmannV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0084713,
author = {Lutz Volkmann},
title = {Fundamente der Graphentheorie},
series = {Springer Lehrbuch Mathematik},
publisher = {Springer},
year = {1996},
isbn = {978-3-211-82774-1},
timestamp = {Wed, 27 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0084713.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/LenkewitzV96,
author = {Ursala Lenkewitz and
Lutz Volkmann},
title = {Neighbourhood and degree conditions for the existence of regular factors},
journal = {Ars Comb.},
volume = {42},
year = {1996},
timestamp = {Tue, 20 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/LenkewitzV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MaschlankaV96,
author = {Peter Maschlanka and
Lutz Volkmann},
title = {Independence number in n-extendable graphs},
journal = {Discret. Math.},
volume = {154},
number = {1-3},
pages = {167--178},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00042-U},
doi = {10.1016/0012-365X(95)00042-U},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MaschlankaV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GuoV96,
author = {Yubao Guo and
Lutz Volkmann},
title = {A Complete Solution of a Problem of Bondy Concerning Multipartite
Tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {66},
number = {1},
pages = {140--145},
year = {1996},
url = {https://doi.org/10.1006/jctb.1996.0010},
doi = {10.1006/JCTB.1996.0010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GuoV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GuoV96,
author = {Yubao Guo and
Lutz Volkmann},
title = {Locally semicomplete digraphs that are complementary \emph{m}-pancyclic},
journal = {J. Graph Theory},
volume = {21},
number = {2},
pages = {121--136},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199602)21:2\&\#60;121::AID-JGT2\&\#62;3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199602)21:2\&\#60;121::AID-JGT2\&\#62;3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GuoV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenGV96,
author = {J{\o}rgen Bang{-}Jensen and
Yubao Guo and
Lutz Volkmann},
title = {Weakly Hamiltonian-connected locally semicomplete digraphs},
journal = {J. Graph Theory},
volume = {21},
number = {2},
pages = {163--172},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199602)21:2\&\#60;163::AID-JGT5\&\#62;3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199602)21:2\&\#60;163::AID-JGT5\&\#62;3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenGV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/GuoV95,
author = {Yabao Guo and
Lutz Volkmann},
title = {Tree-Ramsey numbers},
journal = {Australas. {J} Comb.},
volume = {11},
pages = {169--176},
year = {1995},
url = {http://ajc.maths.uq.edu.au/pdf/11/ocr-ajc-v11-p169.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/GuoV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/DankelmannV95,
author = {Peter Dankelmann and
Lutz Volkmann},
title = {New sufficient conditions for equality of minimum degree and edge-connectivity},
journal = {Ars Comb.},
volume = {40},
year = {1995},
timestamp = {Mon, 09 Feb 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/DankelmannV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Volkmann95,
author = {Lutz Volkmann},
title = {On graphs with equal domination and edge independence numbers},
journal = {Ars Comb.},
volume = {41},
year = {1995},
timestamp = {Fri, 31 Oct 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Volkmann95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GuoV95,
author = {Yubao Guo and
Lutz Volkmann},
title = {A generalization of menger's theorem for certain block - cactus graphs},
journal = {Graphs Comb.},
volume = {11},
number = {1},
pages = {49--52},
year = {1995},
url = {https://doi.org/10.1007/BF01787420},
doi = {10.1007/BF01787420},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GuoV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/RanderathV94,
author = {Bert Randerath and
Lutz Volkmann},
title = {A characterization of well covered block-cactus graphs},
journal = {Australas. {J} Comb.},
volume = {9},
pages = {307},
year = {1994},
url = {http://ajc.maths.uq.edu.au/pdf/9/ocr-ajc-v9-p307.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/RanderathV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann94,
author = {Lutz Volkmann},
title = {on Graphs with Equal Domination and Covering Numbers},
journal = {Discret. Appl. Math.},
volume = {51},
number = {1-2},
pages = {211--217},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90110-4},
doi = {10.1016/0166-218X(94)90110-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SiemesTV94,
author = {Werner Siemes and
Jerzy Topp and
Lutz Volkmann},
title = {On unique independent sets in graphs},
journal = {Discret. Math.},
volume = {131},
number = {1-3},
pages = {279--285},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90389-1},
doi = {10.1016/0012-365X(94)90389-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SiemesTV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuoV94,
author = {Yubao Guo and
Lutz Volkmann},
title = {On complementary cycles in locally semicomplete digraphs},
journal = {Discret. Math.},
volume = {135},
number = {1-3},
pages = {121--127},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(93)E0099-P},
doi = {10.1016/0012-365X(93)E0099-P},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GuoV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GuoV94,
author = {Yubao Guo and
Lutz Volkmann},
title = {Cycles in Multipartite Tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {62},
number = {2},
pages = {363--366},
year = {1994},
url = {https://doi.org/10.1006/jctb.1994.1075},
doi = {10.1006/JCTB.1994.1075},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GuoV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GuoV94,
author = {Yubao Guo and
Lutz Volkmann},
title = {Connectivity properties of locally semicomplete digraphs},
journal = {J. Graph Theory},
volume = {18},
number = {3},
pages = {269--280},
year = {1994},
url = {https://doi.org/10.1002/jgt.3190180306},
doi = {10.1002/JGT.3190180306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GuoV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ToppV93,
author = {Jerzy Topp and
Lutz Volkmann},
title = {Some upper bounds for the product of the domination number and the
chromatic number of a graph},
journal = {Discret. Math.},
volume = {118},
number = {1-3},
pages = {289--292},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90074-4},
doi = {10.1016/0012-365X(93)90074-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ToppV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/StrackeV93,
author = {Christoph Stracke and
Lutz Volkmann},
title = {A new domination conception},
journal = {J. Graph Theory},
volume = {17},
number = {3},
pages = {315--323},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170306},
doi = {10.1002/JGT.3190170306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/StrackeV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ToppV93,
author = {Jerzy Topp and
Lutz Volkmann},
title = {Sufficient conditions for equality of connectivity and minimum degree
of a graph},
journal = {J. Graph Theory},
volume = {17},
number = {6},
pages = {695--700},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170606},
doi = {10.1002/JGT.3190170606},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ToppV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ToppV91,
author = {Jerzy Topp and
Lutz Volkmann},
title = {On graphs with equal domination and independent domination numbers},
journal = {Discret. Math.},
volume = {96},
number = {1},
pages = {75--80},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90473-F},
doi = {10.1016/0012-365X(91)90473-F},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ToppV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ToppV91a,
author = {Jerzy Topp and
Lutz Volkmann},
title = {On packing and covering numbers of graphs},
journal = {Discret. Math.},
volume = {96},
number = {3},
pages = {229--238},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90316-T},
doi = {10.1016/0012-365X(91)90316-T},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ToppV91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FlachV90,
author = {Peter Flach and
Lutz Volkmann},
title = {Estimations for the domination number of a graph},
journal = {Discret. Math.},
volume = {80},
number = {2},
pages = {145--151},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90114-W},
doi = {10.1016/0012-365X(90)90114-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FlachV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/NiessenV90,
author = {Thomas Niessen and
Lutz Volkmann},
title = {Class 1 conditions depending on the minimum degree and the number
of vertices of maximum degree},
journal = {J. Graph Theory},
volume = {14},
number = {2},
pages = {225--246},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140211},
doi = {10.1002/JGT.3190140211},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/NiessenV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Volkmann89,
author = {Lutz Volkmann},
title = {Edge-connectivity in p-partite graphs},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {1--6},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130103},
doi = {10.1002/JGT.3190130103},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Volkmann89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:15 CEST 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:
