Author:
Sýkora Ondrej,Vrťo Imrich
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference12 articles.
1. Brebner, G.,Relating routing graphs and two dimensional array grids, In: Proc. VLSI:Algorithms and Architectures, North Holland, 1985.
2. Erdös, P. and Guy, R. P.,Crossing number problems, American Mathematical Monthly, 80, 1, 1973, 52–58.
3. Harary, F., Hayes, J. P. and Horng-Jyh Wu,A survey of the theory of hypercube graphs, Computers and Mathematics with Applications, 15, 4, 1988, 277–289.
4. Heath, M. I. (editor),Hypercube Multicomputers, Proceedings of the 2-nd Conference on Hypercube Multicomputers, SIAM, 1987.
5. Kainen, P. C.,A lower bound for crossing numbers of graphs with applications to K n ,K p,q , andQ(d), J. Combinatorial Theory (B), 12, 1972, 287–298.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献