An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generation of Cycle Permutation Graphs and Permutation Snarks
An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.