On cycle permutation graphs

DOI10.1016/0012-365X(84)90007-4zbMath0559.05053MaRDI QIDQ802578

Richard D. Ringeisen

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

crossing numbersCycle permutation graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (11)

Large survivable nets and the generalized prisms ⋮ On natural isomorphisms of cycle permutation graphs ⋮ Chromatic automorphisms and symmetries of some graphs ⋮ Isomorphism classes of cycle permutation graphs ⋮ How to determine the maximum genus of a graph ⋮ On the geodetic number of permutation graphs ⋮ Upper embeddability and connectivity of graphs ⋮ Normal 6-edge-colorings of some bridgeless cubic graphs ⋮ On the classification and toughness of generalized permutation star-graphs ⋮ Generalized Petersen graphs which are cycle permutation graphs ⋮ Connectivity of generalized prisms over G

Cites Work

• Generalized Petersen graphs which are cycle permutation graphs
• Search for minimal trivalent cycle permutation graphs with girth nine
• A result on Hamiltonian cycles in generalized Petersen graphs
• Every generalized Petersen graph has a Tait coloring
• The crossing numbers of some generalized Petersen graphs.
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On cycle permutation graphs