Covering Multigraphs by Simple Circuits (Q3703929)

From MaRDI portal
Revision as of 18:47, 14 June 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
Covering Multigraphs by Simple Circuits
scientific article

    Statements

    Covering Multigraphs by Simple Circuits (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Eulerian subgraphs
    0 references
    graph algorithms
    0 references
    nowhere-zero flow
    0 references
    minimum cover
    0 references
    bridgeless multigraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references