New Bounds on Crossing Numbers
暂无分享,去创建一个
Joel H. Spencer | János Pach | Géza Tóth | J. Spencer | J. Pach | G. Tóth
[1] P. Erdös,et al. Crossing Number Problems , 1973 .
[2] I. Reiman. Über ein Problem von K. Zarankiewicz , 1958 .
[3] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .
[4] Robin Thomas,et al. Planar Separators , 1994, SIAM J. Discret. Math..
[5] Zoltán Füredi,et al. New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.
[6] L. A S Z L,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .
[7] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[8] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[9] Noga Alon,et al. Norm-Graphs: Variations and Applications , 1999, J. Comb. Theory, Ser. B.
[10] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .
[11] Tamal K. Dey,et al. Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..
[12] R. Bruce Richter,et al. RELATIONS BETWEEN CROSSING NUMBERS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS , 1997 .
[13] C. T. Benson. Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.
[14] János Pach,et al. Graphs drawn with few crossings per edge , 1997, Comb..
[15] Farhad Shahrokhi,et al. Applications of the crossing number , 1994, SCG '94.
[16] R. Singleton. On Minimal graphs of maximum even girth , 1966 .
[17] Micha Sharir,et al. On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.
[18] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.
[19] N. Alon,et al. A separator theorem for nonplanar graphs , 1990 .
[20] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[21] János Pach,et al. Graphs drawn with few crossings per edge , 1996, GD.
[22] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .
[23] W. G. Brown. On Graphs that do not Contain a Thomsen Graph , 1966, Canadian Mathematical Bulletin.
[24] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[25] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[26] P. Erdös,et al. Crossing Number Problems , 1973 .
[27] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.