Generalized Petersen graphs which are cycle permutation graphs
From MaRDI portal
Publication:790849
DOI10.1016/0095-8956(84)90068-6zbMath0535.05055MaRDI QIDQ790849
Sam Stueckle, Richard D. Ringeisen
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90068-6
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C75: Structural characterization of families of graphs
05C99: Graph theory
Related Items
Cites Work
- On cycle permutation graphs
- Search for minimal trivalent cycle permutation graphs with girth nine
- A result on Hamiltonian cycles in generalized Petersen graphs
- Hamiltonian cycles in generalized Petersen graphs
- Every generalized Petersen graph has a Tait coloring
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item