A separator theorem for graphs of bounded genus (Q3220606)

From MaRDI portal
Revision as of 19:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A separator theorem for graphs of bounded genus
scientific article

    Statements

    A separator theorem for graphs of bounded genus (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    graph algorithms
    0 references
    separators in graphs
    0 references
    graph bisection
    0 references
    planar graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references