Shortest edge-disjoint paths in graphs (Q5096182)

From MaRDI portal
Revision as of 10:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7571954
Language Label Description Also known as
English
Shortest edge-disjoint paths in graphs
scientific article; zbMATH DE number 7571954

    Statements

    title
    Shortest edge-disjoint paths in graphs (English)
    0 references
    author
    Andreas Schwill
    0 references
    published in
    STACS 89
    0 references
    publication date
    16 August 2022
    0 references
    zbMATH Keywords
    \(n\)-geodetically edge-connected graph
    0 references

    Identifiers

    DOI
    10.1007/BFb0029011
    0 references
    zbMATH DE Number
    7571954
    0 references
    OpenAlex ID
    W2096782096
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5096182&oldid=37270033"
    Powered by MediaWiki