The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046)

From MaRDI portal
Revision as of 15:23, 13 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
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
scientific article

    Statements

    title
    The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (English)
    0 references
    author
    Ken-ichi Kawarabayashi
    0 references
    Yusuke Kobayashi
    0 references
    publication date
    31 March 2017
    0 references
    zbMATH Keywords
    edge-disjoint paths
    0 references
    \(4\)-edge-connected graphs
    0 references
    Eulerian graphs
    0 references
    cites work
    Graph Drawing
    0 references
    Q3972951
    0 references
    S-functions for graphs
    0 references
    Q5417629
    0 references
    Q4231910
    0 references
    Q4234048
    0 references
    Q4352948
    0 references
    Q3972953
    0 references
    2-linked graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C38
    0 references
    05C83
    0 references
    05C85
    0 references
    05C45
    0 references
    05C40
    0 references
    zbMATH DE Number
    6699286
    0 references
    OpenAlex ID
    W3136471880
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q520046&oldid=36313202"
    Powered by MediaWiki