The following publications are possibly variants of this publication:
- 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]
- Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique numberLutz Volkmann. arscom, 96, 2010.
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique numberLutz Volkmann. dmgt, 39(2):567-573, 2019. [doi]
- Degree sequence conditions for maximally edge-connected graphs and digraphsPeter Dankelmann, Lutz Volkmann. jgt, 26(1):27-34, 1997. [doi]
- Degree sequence conditions for super-edge-connected graphs and digraphsLutz Volkmann. arscom, 67, 2003.
- Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique numberLutz Volkmann. jgt, 42(3):234-245, 2003. [doi]
- Degree sequence conditions for maximally edge-connected oriented graphsLutz Volkmann. appml, 19(11):1255-1260, 2006. [doi]
- Neighborhood conditions for graphs and digraphs to be maximally edge-connectedAngelika Hellwig, Lutz Volkmann. ajc, 33:265-278, 2005. [doi]
- Maximally edge-connected digraphsAngelika Hellwig, Lutz Volkmann. ajc, 27:23-32, 2003. [doi]