On the crossing numbers of certain generalized Petersen graphs
type: Item
instance of: scholarly article
title: On the crossing numbers of certain generalized Petersen graphs
zbMATH Open document ID: 0756.05048
DOI: 10.1016/0012-365X(92)90453-M
author: R. B. Richter
author: Daniel McQuillan
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: The authors give a short proof of the fact that the generalized Peterson graph \(P(8,3)\) has crossing number 4 and that the crossing number of \(P(10,3)\) is at least five (contrary to a claim by \textit{S. Fiorini} [Combinatorics '84, Proc. Int. Conf. Finite Geom. Comb. Struct., Bari/Italy 1984, Ann. Discrete Math. 30, 225-241 (1986; Zbl 0595.05030)]). The method is interesting in that it focuses on disjoint cycles which must cross each other an even number of times.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 89964
zbMATH Keywords: crossing numbers
zbMATH Keywords: generalized Petersen graphs
reviewed by: Jozef Širáň
MaRDI profile type: Publication
cites work: Q4039906
cites work: The crossing numbers of some generalized Petersen graphs.
cites work: Cubic irreducible graphs for the projective plane
cites work: Cubic graphs with crossing number two
cites work: Q5524326
description: scientific article; zbMATH DE number 89964