Searching for a strong double tracing in a graph (Q1265251)

From MaRDI portal
Revision as of 19:59, 17 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Searching for a strong double tracing in a graph
scientific article

    Statements

    Searching for a strong double tracing in a graph (English)
    0 references
    0 references
    0 references
    28 September 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    \(U\)-turn
    0 references
    strong double tracing
    0 references
    Eulerian graph
    0 references
    connected graph
    0 references