János Pach
- ACNS82.M. Ajtai, V. Chv#tal, M. Newborn, and E. Szemer#di, Crossing-free subgraphs, in: Theory and Practice o/ Combinatorics, North-Holland Math. Stud. 60# North-Holland, Amsterdam-New York, 1982, 9-12.Google Scholar
- ARS98.N. Alon, L. R6nyai, and T. Szab6, Normgraphs: variations and applications, to appear.Google Scholar
- AST90.N. Alon, P. Seymour, and R. Thomas, A separator theorem for nonplanar graphs, J. Amer. Math. Soc. 3 (1990), 801-808.Google ScholarCross Ref
- AST94.N. Alon, P. Seymour, and R. Thomas, Planar separators, SIAM J. of Discrete Math. 7 (1994), 184- 193. Google ScholarDigital Library
- Be66.C. Benson, Minimal regular graphs of girth eight and twelve, Canadian J. Mathematics 18 (1966), 1091-1094.Google ScholarCross Ref
- BS74.J. A. Bondy and M. Simonovits, Cycles of even length in graphs, J. Combinatorial Theory, Set. B 16 (1974), 97-105.Google Scholar
- B66.W. G. Brown, On graphs that do not contain a Thomsen graph, Canadian Mathematical Bulletin 9 (1966), 281-285.Google ScholarCross Ref
- D98.T. K. Dey, Improved bounds for planar k-sets and related problems, Discrete and Computational Geometry 19 (1998), 373-382.Google ScholarCross Ref
- EG73.P. Erd6s and R. K. Guy, Crossing number problems, American Mathematical Monthly 80 (1973), 52- 58.Google ScholarCross Ref
- ER62.P. Erd6s and A. R#nyi, On a problem in the theory of graphs, (in Hungarian), Magyar Tud. Akad. Mat. Kutatd Int. Kiizl. 7 (1962), 623-641.Google Scholar
- F96.Z. F/iredi, New asymptotics for bipartite Turin numbers, J. Combinatorial Theory, Ser. A 75 (1996), 141-144. Google ScholarDigital Library
- GJ83.M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Alg. Disc. Meth. 4 (1983), 312-316.Google ScholarCross Ref
- G72.R. K. Guy, Crossing numbers of graphs, in: Graph theory and applications (Proc. Conf. Western Michigan Univ., Kalamazoo, Mich., 1972) Lecture Notes in Mathematics 303, Springer, Berlin, 111-124.Google Scholar
- KST54.T. K6v#ri, V. T. S6s, and P. Tur~n, On a problem of K. Zarankiewicz, Colloquium Mathematicum 3 (1954), 50-57.Google ScholarCross Ref
- L83.F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, 1983.Google Scholar
- L84.F. T. Leighton, New lower bound techniques for VLSI, Math. Systems Theory 17' (1984), 47-70.Google Scholar
- LT79.R. Lipton and R. Tarjan, A separator theorem for planar graphs, SIAM J. Applied Mathematics 3{} (1979), 177-189.Google Scholar
- PSS96.J. Pach, F. Shahrokhi, and M. Szegedy, Applications of the crossing number, Algorithmica 16 (1996), 111-117.Google ScholarCross Ref
- PS98.J. Pach and M. Sharir, On the number of incidences between points and curves, Combinatorics, Probability and Computing 7 (1998), 121-127. Google ScholarDigital Library
- PT97.J. Pach and G. T6th, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.Google ScholarCross Ref
- R58.I. Reiman, #)ber ein Problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958), 269-279.Google ScholarCross Ref
- RT97.R. B. Richter and C. Thomassen, Relations between crossing numbers of complete and complete bipartite graphs, American Mathematical Monthly, February 1997, 131-137.Google ScholarCross Ref
- RY68.G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. U.S.A. 60 (1968), 438-445.Google ScholarCross Ref
- S97.M. Simonovits, personal communication.Google Scholar
- S66.R. Singleton, On minimal graphs of maximum even girth, J. Combinatorial Theory 1 (1966), 306- 332.Google ScholarCross Ref
- S98.L. A. Sz6kely, Crossing numbers and hard ErdSs problems in discrete geometry, Combinatorics, Probability and Computing 6 (1998), 353-358. Google ScholarDigital Library
- W91.R. Wenger, Extremal graphs with no (74's, C6's, or Clo's, J. Combinatorial Theory, Set. B 52 (1991), 113-116. Google ScholarDigital Library
- WB78.A. T. White and L. W. Beineke, Topological graph theory, in: Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson., eds.), Academic Press, Inc. {Harcourt Brace Jovanovich, Publishers}, London- New York, 1983, 15-49.Google Scholar
Index Terms
- New bounds on crossing numbers
Recommendations
On k-planar crossing numbers
The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. ...
Degenerate Crossing Numbers
Let G be a graph with n vertices and eź4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p, then they properly cross one another at p. It is shown that the number of crossing points, counted without ...
Improved upper bounds on the crossing number
SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometryThe crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph G that does not contain a fixed graph as a minor has crossing number O(Δn), where G has n vertices and maximum ...
Comments