Author:
Aurenhammer Franz,Hagauer Johann
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Aurenhammer, F. and Hagauer, J. Computing equivalence classes among the edges of a graph with applications. Proc. Int. Conf. Algebraic Graph Theory, 1989; Discrete Math., to appear.
2. Brandenburg, L.H., Gopinath, B., Kurshan, R.P. On the addressing problem of loop switching. Bell Systems Tech. J. 51 (1972), 1445–1469.
3. Djokovic, D.Z. Distance-preserving subgraphs of hypercubes. J. Combin. Theory B 14 (1973), 263–267.
4. Garey, M.R. and Graham, R.L. On cubical graphs. J. Combin. Theory B 18 (1975), 84–95.
5. Gilbert, E.N. Gray codes and paths on the n-cube. Bell Systems Tech. J. 37 (1958), 1–12.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献