2015/12/17 by Jonathan McLaughlin, McLaughlin, Jonathan
Computer Science · Engineering · #Digital Image Processing Techniques #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1512.05682
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.