Advanced search
Publication Cover
The American Mathematical Monthly Volume 126, 2019 - Issue 4
Submit an article Journal homepage
594
Views
0
CrossRef citations to date
0
Altmetric
Reviews

Reviews

Lowell BeinekePurdue University, 46805, Fort Wayne, IndianaCorrespondence[email protected]
Pages 379-384 | Received 07 Jan 2019, Accepted 07 Jan 2019, Published online: 22 Apr 2019

References

  • Beineke, L., Wilson, R. (2010). The early history of the brick factory problem. Math. Intell. 32(2): 41–48. DOI: 10.1007/s00283-009-9120-4.
  • Bienstock, D., Dean, N. (1993). Bounds for rectilinear crossing numbers. J. Graph Theory. 17(3): 333–348. DOI: 10.1002/jgt.3190170308.
  • Fáry, I. (1948). On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math. 11: 229–233.
  • Frink, O., Smith, P. A. (1930). Irreducible non-planar graphs. Bull. AMS. 36(3): 214. doi.org/10.1090/S0002-9904-1930-04929-0.
  • Garey, M. R., Johnson, D. S. (1983). Crossing number is NP-complete. SIAM J. Alg. Disc. Methods. 4(3): 312–316. DOI: 10.1137/0604033.
  • Harary, F., Kainen, P. C., Schwenk, A. J. (1973). Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6(1): 58–67.
  • Harborth, H. (1976). Parity of numbers of crossings for complete n-partite graphs. Math. Slovaca. 2(2): 77–95. DOI: 10.1016/S0012-365X(01)00078-4.
  • Kuratowski, K. (1930). Sur le probème des courbes gauches en topologie. Fund. Math. 15(1): 271–283. DOI: 10.4064/fm-15-1-271-283.
  • Turán, P. (1977). A note of welcome. J. Graph Theory. 1(1): 7–9. DOI: 10.1002/jgt.3190010105.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.