Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. T. Ho, M. Naor and E. Szemeredi, Fault tolerant graphs, perfect hash functions and disjoint paths, Proc. 33rd IEEE FOCS, Pittsburgh, IEEE (1992), 693–702.
2. N. Alon, The strong chromatic number of a graph, Random Structures and Algorithms, 3 (1992), 1–7.
3. N. Alon and V. Asodi, Sparse universal graphs, Journal of Computational and Applied Mathematics, 142 (2002), 1–11.
4. N. Alon and M. Capalbo, Sparse universal graphs for bounded degree graphs, Random Structures and Algorithms, 31 (2007), 123–133.
5. N. Alon and M. Capalbo, Optimal universal graphs with deterministic embedding, Proc. of the Nineteenth Annual ACM-SIAM SODA (2008), 373–378.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献