Abstract

In his paper on the crossing numbers of generalized Peterson graphs, Fiorini proves that P(8,3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the second claim is false. The techniques are interesting in that they focus on disjoint cycles, which must cross each other an even number of times.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call