Abstract
The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. In this paper, we show that the skewness of the generalized Petersen graph P (3k, k) is \(\lceil\frac{k}{2}+1\rceil\), where k ≥ 4. As a byproduct, it is shown that for k ≥ 4, \(\lceil\frac{k}{2}+1\rceil \leq cr(P(3k,k)) \leq k\), where cr (G) denotes the crossing number of G.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chia, G.L., Gan, C.S.: On crossing numbers of 5-regular graphs. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 230–237. Springer, Heidelberg (2002)
Chia, G.L., Gan, C.S.: Minimal regular graphs with given girths and crossing numbers. Discussiones Mathematicae – Graph Theory (to appear)
Cimikowski, R.J.: Graph planarization and skewness. Congr. Numer. 88, 21–32 (1992)
Exoo, G., Harary, F., Kabell, J.: The crossing numbers of some generalized Petersen graphs. Math. Scand. 48, 184–188 (1981)
Fiorini, S.: On the crossing number of generalized Petersen graphs. Ann. Discrete Math. 30, 225–242 (1986)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic & Discrete Methods 4, 312–316 (1983)
Liebers, A.: Planarizing Graphs - A Survey and Annotated Bibliography. J. Graph Algorithms and Applications 5, 1–74 (2001)
McQuillan, D., Richter, R.B.: On the crossing numbers of certain generalized Petersen graphs. Discrete Math. 104, 311–320 (1992)
Richter, R.B., Salazar, G.: The crossing number of P(N, 3). Graphs Combin. 18, 381–394 (2002)
Salazar, G.: On the crossing numbers of loop networks and Generalized Petersen Graphs. Discrete Math. (to appear)
Saražin, M.L.: The crossing number of the generalized Petersen graph P(10, 4) is four. Mathematica Slovaca 47, 189–192 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chia, G.L., Lee, C.L. (2005). Crossing Numbers and Skewness of Some Generalized Petersen Graphs. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30540-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24401-1
Online ISBN: 978-3-540-30540-8
eBook Packages: Computer ScienceComputer Science (R0)