Author:
Exoo Geoffrey,Ismailescu Dan,Lim Michael
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference15 articles.
1. Breláz, D.: New methods to color the vertices of a graph. Commun. ACM 22, 251–256 (1979)
2. Cantwell, K.: Finite Euclidean Ramsey theory. J. Comb. Theory Ser. A 73, 273–285 (1996)
3. Cibulka, J.: On the chromatic number of real and rational spaces. Geombinatorics 18, 53–65 (2008)
4. Coulson, D.: A $$15$$ 15 -colouring of $$3$$ 3 -space omitting distance one. Discrete Math. 256, 83–90 (2002)
5. de Bruijn, N.G., Erdős, P.: A colour problem for infinite graphs and a problem in the theory of relations. Ned. Akad. Wet. Proc. Ser. A 54, 371–373 (1951)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献