Generating the cycle space of planar graphs (Q2346473)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generating the cycle space of planar graphs
scientific article

    Statements

    Generating the cycle space of planar graphs (English)
    0 references
    0 references
    2 June 2015
    0 references
    Summary: We prove that the cycle space of every planar finitely separable 3-connected graph \(G\) is generated by some \(\mathrm{Aut}(G)\)-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
    0 references
    graph theory
    0 references
    planar graphs
    0 references
    cycle space
    0 references

    Identifiers