On edge-Hamiltonian property of Cayley graphs (Q1112835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3921269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley digraphs of prime-power order are hamiltonian / rank
 
Normal rank

Latest revision as of 11:16, 19 June 2024

scientific article
Language Label Description Also known as
English
On edge-Hamiltonian property of Cayley graphs
scientific article

    Statements

    On edge-Hamiltonian property of Cayley graphs (English)
    0 references
    0 references
    1988
    0 references
    A well-known conjecture of Lovasz says that every Cayley graph is Hamiltonian. In the paper under review it is dealt with a question related to this conjecture, namely whether every edge of a Hamiltonian Cayley graph lies on a Hamiltonian cycle. An affirmative answer is given in the case of Cayley graph G(X)/X is a set of generators of the group G/ where either X is a minimal set of generators or each element of X is of even order.
    0 references
    0 references
    Hamiltonian graph
    0 references
    Cayley graph
    0 references
    0 references