NP-completeness of the Eulerian walk problem for a multiple graph (Q6495489)

From MaRDI portal
Revision as of 06:19, 6 November 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7841151
Language Label Description Also known as
English
NP-completeness of the Eulerian walk problem for a multiple graph
scientific article; zbMATH DE number 7841151

    Statements

    NP-completeness of the Eulerian walk problem for a multiple graph (English)
    0 references
    30 April 2024
    0 references
    multiple graph
    0 references
    multiple path
    0 references
    divisible graph
    0 references
    covering trails
    0 references
    edge-disjoint paths
    0 references
    Eulerian trail
    0 references
    Eulerian cycle
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references