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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.
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.
-
Facial diagrams and cycle double cover
Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.