Advertisement

Crossing numbers of graphs

  • Richard K. Guy
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 303)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Blažek and M. Koman, A minimal problem concerning complete plane graphs, (M. Fiedler, editor), Theory of Graphs and its Applications, Proc. Symp. Smolenice, 1963, Prague 1964, 113–117; MR 30 #4249.Google Scholar
  2. 2.
    __________, On an extremal problem concerning graphs, Comm. Math. Univ. Carolinae 8 (1967), 49–52; MR 35 #1506.MathSciNetzbMATHGoogle Scholar
  3. 3.
    R. B. Eggleton, Ph.D. thesis, Univ. of Calgary, 1973.Google Scholar
  4. 4.
    R. B. Eggleton and R. K. Guy, The crossing number of the n-cube, Amer. Math. Soc. Notices 17 (1970), 757.Google Scholar
  5. 5.
    P. Erdős and R. K. Guy, Crossing number problems Amer. Math. Monthly, to appear in 1972.Google Scholar
  6. 6.
    P. Erdős and G. Szerkeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.MathSciNetGoogle Scholar
  7. 7.
    I. Fáry, On straight line representation of planar graphs, Acta Sci. Math. (Szeqed) 11 (1948), 229–233; MR 10 #136.MathSciNetzbMATHGoogle Scholar
  8. 8.
    R. K. Guy, A combinatorial problem, Nabla (Bull. Malayan Math. Soc.) 7 (1960), 68–72.MathSciNetGoogle Scholar
  9. 9.
    _____, The decline and fall of Zarankiewicz's theorem (F. Harary, editor), Proof Techniques in Graph Theory, Academic Press, N.Y., 1969, 63–69.Google Scholar
  10. 10.
    _____, Sequences associated with a problem of Turán and other problems, Proc. Balatonfüred Combinatorics Conference, 1969, Bolyai János Matematikai Tarsultat, Budapest, 1970, 553–569.Google Scholar
  11. 11.
    _____, Latest results on crossing numbers, Recent Trends in Graph Theory, Springer, N.Y., 1971, 143–156.CrossRefGoogle Scholar
  12. 12.
    R. K. Guy, and A. Hill, The crossing number of the complement of a circuit, (submitted to) Discrete Math.Google Scholar
  13. 13.
    R. K. Guy and T. A. Jenkyns, The toroidal crossing number of Km,n, J. Combinatorial Theory 6 (1969), 235–250; MR 38 #5660.MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    R. K. Guy, T. A. Jenkyns, and J. Schaer, The toroidal crossing number of the complete graph, J. Combinatorial Theory 4 (1968), 376–390; MR 36 #3682.MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    F. Harary and A. Hill, On the number of crossings in a complete graph, Proc. Edinburgh Math. Soc. (2) 13 (1962–63), 333–338; MR 29 #602.MathSciNetzbMATHGoogle Scholar
  16. 16.
    H. F. Jensen, An upper bound for the rectilinear crossing number of the complete graph, J. Combinatorial Theory, Ser. B, 10 (1971), 212–216.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    P. C. Kainen, On a problem of Erdős, J. Combinatorial Theory 5 (1968), 374–377; MR 38 #72.MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    P. C. Kainen, A lower bound for crossing numbers of graphs with applications to Kn, Kp,q and Q(d), J. Combinatorial Theory, to appear.Google Scholar
  19. 19.
    _____, On the stable crossing number of cubes, Proc. Amer. Math. Soc., to appearGoogle Scholar
  20. 20.
    D. J. Kleitman, The crossing number of K5,n, J. Combinatorial Theory 9 (1970), 315–323.MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    M. Koman, On the crossing numbers of graphs, Acta Univ. Carolinae, Math. Phys. 10 (1969), 9–46.MathSciNetzbMATHGoogle Scholar
  22. 22.
    K. Kuratowski, Sur le problème des courbes gauches en topologie, Fund. Math. 15 (1930), 271–283.zbMATHGoogle Scholar
  23. 23.
    J. W. Moon, On the distribution of crossings in random complete graphs, J. Soc. Indust. App. Math. 13 (1965), 506–510; MR 31 #3357.MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    T. L. Saaty, The minimum number of intersections in complete graphs, Proc. Nat. Acad. Sci., U.S.A. 52 (1964), 688–690; MR 29 #4045.MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    _____, Two theorems on the minimum number of intersections for complete graphs, J. Combinatorial Theory 2 (1967), 571–584; MR 35 #2796.MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    _____, Symmetry and the crossing number for complete graphs, J. Res. Nat. Bureau Standards 73B (1969), 177–186.MathSciNetzbMATHGoogle Scholar
  27. 27.
    W. T. Tutte, How to draw a graph, Proc. London Math. Soc. (3), 13 (1963), 743–767; MR 28 #1610.MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    _____, Towards a theory of crossing numbers, J. Combinatorial Theory 8 (1970), 45–53.MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    K. Urbaník, Solution du problème posé par P. Turán, Colloq. Math. 3 (1955), 200–201.Google Scholar
  30. 30.
    K. Zarankiewicz, On a problem of P. Turán concerning graphs, Fund. Math. 41 (1954), 137–145; Mr 16 #156.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1972

Authors and Affiliations

  • Richard K. Guy
    • 1
  1. 1.University of CalgaryCalgaryCanada

Personalised recommendations