A construction of 3-connected graphs (Q1327517)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A construction of 3-connected graphs
scientific article

    Statements

    A construction of 3-connected graphs (English)
    0 references
    0 references
    0 references
    19 June 1994
    0 references
    A new recursive construction of 3-connected graphs is presented. It is shown that any 3-connected graph can be obtained from the complete graph on 4 vertices and the complete bipartite graph \(K_{3,3}\) using two simple operations.
    0 references
    0 references
    recursive construction
    0 references
    3-connected graphs
    0 references