Article ID Journal Published Year Pages File Type
8903122 Discrete Mathematics 2018 8 Pages PDF
Abstract
In this note we present degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number of the underlying graph.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
Authors
, ,