Patch Colorings and Rigid Colorings of the Rational n-Space
暂无分享,去创建一个
[1] Peter D. Johnson. Two-colorings of a dense subgroup of Qn that forbid many distances , 1990, Discret. Math..
[2] Michael Reid. On the connectivity of unit distance graphs , 1996, Graphs Comb..
[3] A. Wiles,et al. Ring-Theoretic Properties of Certain Hecke Algebras , 1995 .
[4] D. R. WQODALL. Distances Realized by Sets Covering the Plane* , 2003 .
[5] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .
[6] H. Hadwiger,et al. Ein ?berdeckungssätze für den Euklidischen Raum , 1944 .
[7] Kiran B. Chilakamarri. Unit-distance graphs in Minkowski metric spaces , 1991 .
[8] C. Y. Hsiung,et al. Elementary theory of numbers , 1992 .
[9] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .
[10] Joseph Zaks. On the connectedness of some geometric graphs , 1990, J. Comb. Theory, Ser. B.
[11] C. Rogers,et al. The realization of distances within sets in Euclidean space , 1972 .
[12] J. Pach. Finite point configurations , 1997 .
[13] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[14] A. Wiles. Modular Elliptic Curves and Fermat′s Last Theorem(抜粋) (フェルマ-予想がついに解けた!?) , 1995 .
[15] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[16] Joseph Zaks. On four-colourings of the rational four-space , 1989 .