3-connected graphs and their degree sequences
classification
🧮 math.CO
keywords
connectedsequenceconditionsdegreegraphgraphsdetailedentries
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.