Improving Bounds for the Crossing Numbers on Surfaces of Genus g
暂无分享,去创建一个
[1] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .
[2] Jonathan L. Gross. An infinite family of octahedral crossing numbers , 1978, J. Graph Theory.
[3] Paul C. Kainen,et al. A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d) , 1972 .
[4] Tom Jenkyns,et al. The toroidal crossing number of the complete graph , 1968 .
[5] P. Erdös,et al. Crossing Number Problems , 1973 .
[6] Richard K. Guy,et al. The toroidal crossing number of Km,n , 1969 .
[7] Ondrej Sýkora,et al. Edge Separators for Graphs of Bounded Genus with Applications , 1993, Theor. Comput. Sci..
[8] Farhad Shahrokhi,et al. Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry , 1992, Conference on Integer Programming and Combinatorial Optimization.
[9] Ondrej Sýkora,et al. On crossing numbers of hypercubes and cube connected cycles , 1993, BIT.