On the crossing numbers of certain generalized Petersen graphs (Q1198516)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 89964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the crossing numbers of certain generalized Petersen graphs |
scientific article; zbMATH DE number 89964 |
Statements
On the crossing numbers of certain generalized Petersen graphs (English)
0 references
16 January 1993
0 references
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.
0 references
crossing numbers
0 references
generalized Petersen graphs
0 references
0.9109184145927428
0 references
0.90897536277771
0 references
0.9087105989456176
0 references
