Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes

DOI10.1007/s00373-016-1679-xzbMath1349.05198OpenAlexW2261340988MaRDI QIDQ343754

Elena V. Konstantinova, Alexey N. Medvedev

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1679-x

zbMATH Keywords

even cyclesdisjoint cycle coverfastening cyclepancake graphpancake sortingprefix-reversal Gray codes

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Chromatic properties of the Pancake graphs ⋮ Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph ⋮ Greedy cycles in the star graphs ⋮ Lengths of cycles in generalized pancake graphs ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• On the embedding of cycles in pancake graphs
• A new algorithm for generation of permutations
• The Greedy Gray Code Algorithm
• Small cycles in the Pancake graph
• Combinatorial Gray Codes
• A Survey of Combinatorial Gray Codes

This page was built for publication: Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes