Finding shortest contractible and shortest separating cycles in embedded graphs (Q2930300)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding shortest contractible and shortest separating cycles in embedded graphs
scientific article

    Statements

    Finding shortest contractible and shortest separating cycles in embedded graphs (English)
    0 references
    0 references
    18 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3-path condition
    0 references
    forbidden pairs
    0 references
    graphs on surfaces
    0 references
    topological graph theory
    0 references
    0 references