Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
DOI10.1007/S00373-016-1679-XzbMATH Open1349.05198OpenAlexW2261340988MaRDI QIDQ343754FDOQ343754
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
Recommendations
disjoint cycle covereven cyclesfastening cyclepancake graphpancake sortingprefix-reversal Gray codes
Deterministic network models in operations research (90B10) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)
Cites Work
Cited In (6)
- Chromatic properties of the Pancake graphs
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group
- Lengths of cycles in generalized pancake graphs
- Some integer values in the spectra of burnt pancake graphs
- Greedy cycles in the star graphs
- Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
Uses Software
This page was built for publication: Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343754)