3-connected graphs and their degree sequences
From MaRDI portal
Publication:4576314
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.
Recommendations
- Graphs and degree sequences: A survey. III
- Realizing degree sequences as \(Z_3\)-connected graphs
- Enumeration of the degree sequences of 3-connected graphs and cactus graphs.
- On \(3^*\)-connected graphs
- Decomposition of 3-connected graphs
- A construction of 3-connected graphs
- Order and radius of 3-connected graphs
- Extremal 3-connected graphs
- On cycles in 3-connected graphs
- Degree sequences in triangle-free graphs
Cited in
(6)- scientific article; zbMATH DE number 7523847 (Why is no real title available?)
- Realizing degree sequences as \(Z_3\)-connected graphs
- The 3-connected simple graphs of order \(n\) with minimum number of edges and their construction
- Enumeration of the degree sequences of 3-connected graphs and cactus graphs.
- scientific article; zbMATH DE number 4191733 (Why is no real title available?)
- Degree sequences and edge connectivity
This page was built for publication: 3-connected graphs and their degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576314)
