2013/07/11 by Jonathan McLaughlin, McLaughlin, Jonathan
Computer Science · #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1307.3129
openalex publication_date 2013/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation ∼2 and a related concept of the ∼2-core of a graph. The case of k-connected graphs for k≥ 4 is also addressed.