On the crossing numbers of certain generalized Petersen graphs (Q1198516): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4039906 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The crossing numbers of some generalized Petersen graphs. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cubic irreducible graphs for the projective plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cubic graphs with crossing number two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5524326 / rank | |||
Normal rank | |||
Latest revision as of 14:11, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the crossing numbers of certain generalized Petersen graphs |
scientific article |
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
