Locating any two vertices on Hamiltonian cycles in large graphs (Q776260)

From MaRDI portal
Revision as of 10:47, 5 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
Locating any two vertices on Hamiltonian cycles in large graphs
scientific article

    Statements

    Locating any two vertices on Hamiltonian cycles in large graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2020
    0 references
    Hamiltonian cycle
    0 references
    Enomoto's conjecture
    0 references
    regularity lemma
    0 references
    blow-up lemma
    0 references

    Identifiers