The crossing numbers of generalized Petersen graphs with small order

DOI10.1016/j.dam.2008.01.012zbMath1169.05316OpenAlexW1969842214MaRDI QIDQ1028429

J. Blot

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.012

zbMATH Keywords

embeddingcrossing numberplanar graphgeneralized Petersen graph

Mathematics Subject Classification ID

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

Related Items (7)

Unnamed Item ⋮ The crossing number of locally twisted cubes \(L T Q_n\) ⋮ The crossing number of \(C(n; \{1,3\})\) ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs ⋮ The crossing number of the generalized Petersen graphP(10, 3) is six ⋮ An upper bound for the crossing number of augmented cubes

Cites Work

• On the crossing numbers of certain generalized Petersen graphs
• The crossing number of \(P(N,3)\)
• Crossing Number is NP-Complete
• The crossing numbers of some generalized Petersen graphs.
• On the Möbius Ladders
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The crossing numbers of generalized Petersen graphs with small order