The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) (Q1345967): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Doubly adjacent gray codes for the symmetric group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and circuits in finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Hamilton-connectedness of certain vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method and two algorithms on the theory of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mechanical counting method and combinatorial applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian circuits in Cayley diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey: Hamiltonian cycles in Cayley graphs / rank
 
Normal rank

Revision as of 11:20, 23 May 2024

scientific article
Language Label Description Also known as
English
The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking)
scientific article

    Statements

    The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) (English)
    0 references
    0 references
    0 references
    0 references
    5 December 1996
    0 references
    directed Cayley graph
    0 references
    Hamiltonian path
    0 references
    backtracking
    0 references

    Identifiers