The following publications are possibly variants of this publication:
- Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique numberLutz Volkmann. arscom, 96, 2010.
- Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique numberLutz Volkmann. arscom, 99:55-64, 2011.
- Degree sequence conditions for maximally edge-connected graphs depending on the clique numberPeter Dankelmann, Lutz Volkmann. DM, 211:217-223, 2000. [doi]
- Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique numberSebastian Milz, Lutz Volkmann. DM, 341(2):484-491, 2018. [doi]
- Sufficient conditions for graphs to be lambda -optimal, super-edge-connected, and maximally edge-connectedAngelika Hellwig, Lutz Volkmann. jgt, 48(3):228-246, 2005. [doi]
- Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-ConnectedZhen-Mu Hong, Zheng-Jiang Xia, Fu-Yuan Chen, Lutz Volkmann. complexity, 2021, 2021. [doi]