Longest cycles in 3-connected planar graphs (Q910413)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Longest cycles in 3-connected planar graphs
scientific article

    Statements

    Longest cycles in 3-connected planar graphs (English)
    0 references
    0 references
    0 references
    1992
    0 references
    We give lower bounds on the length of a longest cycle in a planar graph on n vertices which is 3-connected or cyclically 4-connected.
    0 references
    lower bounds
    0 references
    length
    0 references
    longest cycle
    0 references
    planar graph
    0 references
    3-connected
    0 references
    cyclically 4-connected
    0 references

    Identifiers