Hamilto-connected derangement graphs on S n

No abstract is available for this paper.

• Publication year

  1994

• Venue

  Discrete Mathematics

• Publication date

  1994-10-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0012-365X(94)90028-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hamiltonian cycles in the cayley graph of s(n) and a doubly adjacent gray code

  1990cited by this paper
• Generating Permutations with k-Differences

  1990cited by this paper
• Longest ab-Paths in Regular Graphs

  1988cited by this paper
• Cayley digraphs and (1, j, n)-sequencings of the alternating groups An

  1987cited by this paper
• Combinatorial Algorithms: An Update

  1987cited by this paper
• A survey: Hamiltonian cycles in Cayley graphs

  1984cited by this paper
• Hamilton cycles in regular 2-connected graphs

  1980cited by this paper
• Permutation Generation Methods

  1977cited by this paper
• Sequential generation of arrangements by means of a basis of transpositions

  1975cited by this paper
• Connectivity of transitive graphs

  1970cited by this paper
• Generation of permutations by adjacent transposition

  1963cited by this paper
• Certification of Algorithm 19: Binomial coefficients

  1962cited by this paper
• Mathematics Magazine

  1951cited by this paper

• Edge pancyclic Cayley graphs on symmetric group

  2025cites this paper
• Generating All Invertible Matrices by Row Operations

  2024cites this paper
• Maximum-Size Independent Sets and Automorphism Groups of Tensor Powers of the Even Derangement Graphs

  2011cites this paper
• Automorphism Group of the Derangement Graph

  2011cites this paper
• The Erdős-Ko-Rado Theorem for intersecting families of permutations.

  2010cites this paper
• Symmetries of Graphs and Networks

  2009influential citation
• Symmetries of Graphs and Networks

  2009cites this paper
• A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations

  2007cites this paper
• On the Spectrum of the Derangement Graph

  2007cites this paper
• On quasiabelian Cayley graphs and graphical doubly regular representations

  2002cites this paper
• A Survey of Combinatorial Gray Codes

  1997cites this paper
• Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey

  1996cites this paper