Abstract
The crossing number of a graph is the minimum number of crossings that occur in a drawing of the graph in the plane. This notion is natural and easy to understand, yet we do not know much about it apart from some basic properties. History, successes and pitfalls, some recent developments, and future directions will be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28, 300–343 (1984)
Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory 17, 333–348 (1993)
Bokal, D., Fijavž, G., Mohar, B.: The minor crossing number. SIAM J. Discret. Math. 20(2), 344–356 (2006)
Cabello, C., Mohar, B.: Crossing and weighted crossing number of near-planar graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 38–49. Springer, Heidelberg (2009)
Cabello, C., Mohar, B.: Adding one edge to planar graphs makes crossing number hard. In: SoCG 2010 (2010)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Discr. Meth. 4, 312–316 (1983)
Grohe, M.: Computing crossing numbers in quadratic time. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, Hersonissos, Greece, pp. 231–236 (July 2001), doi:10.1145/380752.380805
Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, San Diego, California, USA, June 11-13 (2007), doi:10.1145/1250790.1250848.
Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41, 289–308 (2005)
Hliněný, P., Salazar, G.: On the crossing number of almost planar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 162–173. Springer, Heidelberg (2007)
Leighton, F.T.: Complexity issues in VLSI. MIT Press, Cambridge (1983)
Leighton, F.T.: New lower bound techniques for VLSI. Math. Systems Theory 17, 47–70 (1984)
Liebers, A.: Planarizing graphs—a survey and annotated bibliography. J. Graph Algorithms Appl. 5, 74 pages (2001)
Mohar, B.: On the crossing number of almost planar graphs. Informatica 30, 301–303 (2006)
Mohar, B., Stephen, T.: The expected crossing number for random edge-weights (in preparation)
Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Odd Crossing Number Is Not Crossing Number. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 386–396. Springer, Heidelberg (2006)
Riskin, A.: The crossing number of a cubic plane polyhedral map plus an edge. Studia Sci. Math. Hungar. 31, 405–413 (1996)
Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt’o, I.: Crossing numbers: bounds and applications. In: Barany, I., Böröczky, K. (eds.) Intuitive geometry (Budapest, 1995). Bolyai Society Mathematical Studies, vol. 6, pp. 179–206. Akademia Kiado (1997)
Székely, L.A.: A successful concept for measuring non-planarity of graphs: The crossing number. Discrete Math. 276, 331–352 (2004)
Vrt’o, I.: Crossing number of graphs: A bibliography, ftp://ftp.ifi.savba.sk/pub/imrich/crobib.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohar, B. (2010). Do We Really Understand the Crossing Numbers?. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-15155-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15154-5
Online ISBN: 978-3-642-15155-2
eBook Packages: Computer ScienceComputer Science (R0)