Generalized Petersen graphs which are cycle permutation graphs
From MaRDI portal
Publication:790849
DOI10.1016/0095-8956(84)90068-6zbMATH Open0535.05055OpenAlexW2003005859MaRDI QIDQ790849FDOQ790849
Authors: 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
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Title not available (Why is that?)
- Every generalized Petersen graph has a Tait coloring
- Title not available (Why is that?)
- Search for minimal trivalent cycle permutation graphs with girth nine
- Hamiltonian cycles in generalized Petersen graphs
- On cycle permutation graphs
- A result on Hamiltonian cycles in generalized Petersen graphs
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Permutation graphs and Petersen graph
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
- On Ringeisen's isolation game
- On cycle permutation graphs
- Some families of combination and permutation graphs.
- Multiple Petersen subdivisions in permutation graphs
- On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
- \((G_1, G_2)\)-permutation graphs
This page was built for publication: Generalized Petersen graphs which are cycle permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790849)
