Algorithm for two disjoint long paths in 2-connected graphs (Q986559)

From MaRDI portal
Revision as of 02:30, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithm for two disjoint long paths in 2-connected graphs
scientific article

    Statements

    Algorithm for two disjoint long paths in 2-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    path
    0 references
    degree sum
    0 references
    dominating path
    0 references
    0 references