Computing the vertex separation of unicyclic graphs (Q596295)

From MaRDI portal
Revision as of 20:23, 1 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the vertex separation of unicyclic graphs
scientific article

    Statements

    Computing the vertex separation of unicyclic graphs (English)
    0 references
    0 references
    10 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms
    0 references
    Unicyclic graphs
    0 references
    Trees
    0 references
    Vertex separation
    0 references
    Search number
    0 references
    Pathwidth
    0 references
    Linear layouts
    0 references
    Layout extensibility
    0 references