Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem (Q2898470)

From MaRDI portal
Revision as of 10:16, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem
scientific article

    Statements

    Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem (English)
    0 references
    0 references
    0 references
    11 July 2012
    0 references
    Hamiltonian circuit problem
    0 references
    directed line graphs
    0 references
    quasi-adjoint graphs
    0 references
    graph reduction
    0 references
    digraphs
    0 references

    Identifiers

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