Q957938

From Wikidata
Jump to: navigation, search

Lovász conjecture(Q957938)

an unproven conjecture, that every finite connected vertex-transitive graph contains a Hamiltonian path
    No aliases defined.
[edit]
Language Label Description Also known as
English
Lovász conjecture
an unproven conjecture, that every finite connected vertex-transitive graph contains a Hamiltonian path

    Statements

    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]