Hamilton cycles in line graphs of 3-hypergraphs (Q2144607)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hamilton cycles in line graphs of 3-hypergraphs
scientific article

    Statements

    Hamilton cycles in line graphs of 3-hypergraphs (English)
    0 references
    0 references
    0 references
    14 June 2022
    0 references
    The authors prove that a 52-connected line graph of a rank 3 hypergraph is Hamiltonian.
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamilton cycle
    0 references
    line graph
    0 references
    3-hypergraph
    0 references
    0 references
    0 references