Using edge cuts to find Euler tours and Euler families in hypergraphs (Q6172287)

From MaRDI portal
Revision as of 18:30, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7714267
Language Label Description Also known as
English
Using edge cuts to find Euler tours and Euler families in hypergraphs
scientific article; zbMATH DE number 7714267

    Statements

    Using edge cuts to find Euler tours and Euler families in hypergraphs (English)
    0 references
    0 references
    0 references
    19 July 2023
    0 references
    Euler tour
    0 references
    Euler family
    0 references
    edge cut
    0 references
    edge cut assignment
    0 references
    collapsed hypergraph
    0 references

    Identifiers

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