Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Alon, N., McDiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Structures & Algorithms 2, 277–288 (1991)
2. Bermond, J.-C., Darrot, E., Delmas, O., Perennes, S.: Hamiltonian circuits in the directed wrapped butterfly network. Discrete Applied Math. 84, 21–42 (1998)
3. Bermond, J.-C., Peyrat, C.: De Bruijn and Kautz networks: A competition for the hypercube? In: André, F., Verjus, J.P. (eds.) Hypercube and distributed computers, pp. 279–293. North Holland, Amsterdam (1989)
4. Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B 27, 320–331 (1979)
5. Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with application to VLSI design. SIAM J. Algebraic Discrete Methods 8, 33–58 (1987)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献