Sebastian Milz, Lutz Volkmann. Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number. Discrete Mathematics, 341(2):484-491, 2018. [doi]
@article{MilzV18,
title = {Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number},
author = {Sebastian Milz and Lutz Volkmann},
year = {2018},
doi = {10.1016/j.disc.2017.09.015},
url = {https://doi.org/10.1016/j.disc.2017.09.015},
researchr = {https://researchr.org/publication/MilzV18},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {341},
number = {2},
pages = {484-491},
}