On the crossing numbers of certain generalized Petersen graphs. (English) Zbl 0756.05048

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 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.


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


Zbl 0595.05030
Full Text: DOI


[1] Bouwer, I. Z., The Foster Census (1988), Charles Babbage Research Centre: Charles Babbage Research Centre Winnipeg · Zbl 0639.05043
[2] Exoo, G.; Harary, F.; Kabell, J., The crossing numbers of some generalized Peterson graphs, Math. Scand., 48, 184-188 (1981) · Zbl 0442.05021
[3] Fiorini, S., On the crossing number of generalized Peterson graphs, (Ann. Discrete Math., Vol. 30 (1986), North-Holland: North-Holland Amsterdam), 225-242
[4] Glover, H. H.; Huneke, J. P., Cubic irreducible graphs for the projective plane, Discrete Math., 13, 341-355 (1975) · Zbl 0335.05103
[5] Richter, R. B., Cubic graphs with crossing number two, J. Graph Theory, 12, 363-374 (1988) · Zbl 0659.05044
[6] Tutte, W. T., Connectivity in Graphs (1966), Univ. of Toronto Press: Univ. of Toronto Press Toronto · Zbl 0146.45603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.