2015/12/17 by Jonathan McLaughlin, McLaughlin, Jonathan
Computer Science · Engineering · #05C40 #Combinatorics (math.CO) #Digital Image Processing Techniques #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1512.05675
openalex publication_date 2015/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence can only be realised as a 3-connected graph. Finally, a matrix is introduced whose non-empty entries partition the set of 3-connected graphs.