Problems for Solution

doi:10.1017/S0008439500025753

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Erdös, Paul Harary, Frank and Tutte, William T. 1965. On the dimension of a graph. Mathematika, Vol. 12, Issue. 2, p. 118.

Erdös, P Graham, R.L Montgomery, P Rothschild, B.L Spencer, J and Straus, E.G 1973. Euclidean ramsey theorems. I. Journal of Combinatorial Theory, Series A, Vol. 14, Issue. 3, p. 341.

Woodall, D.R 1973. Distances realized by sets covering the plane. Journal of Combinatorial Theory, Series A, Vol. 14, Issue. 2, p. 187.

Wormald, Nicholas 1979. A 4-chromatic graph with a special plane drawing. Journal of the Australian Mathematical Society, Vol. 28, Issue. 1, p. 1.

Eggleton, R.B Erdös, P and Skilton, D.K 1985. Colouring the real line. Journal of Combinatorial Theory, Series B, Vol. 39, Issue. 1, p. 86.

Székely, L.A. and Wormald, N.C. 1989. Bounds on the measurable chromatic number of Rn. Discrete Mathematics, Vol. 75, Issue. 1-3, p. 343.

Currie, J.D. 1992. Connectivity of distance graphs. Discrete Mathematics, Vol. 103, Issue. 1, p. 91.

Deuber, Walter A. and Zhu, Xuding 1997. The chromatic numbers of distance graphs. Discrete Mathematics, Vol. 165-166, Issue. , p. 195.

Zhu, Xuding 1998. Pattern Periodic Coloring of Distance Graphs. Journal of Combinatorial Theory, Series B, Vol. 73, Issue. 2, p. 195.

Kemnitz, Arnfried and Kolberg, Halka 1998. Coloring of integer distance graphs. Discrete Mathematics, Vol. 191, Issue. 1-3, p. 113.

Pritikin, Dan 1998. All Unit-Distance Graphs of Order 6197 Are 6-Colorable. Journal of Combinatorial Theory, Series B, Vol. 73, Issue. 2, p. 159.

Chang, Gerard J Liu, Daphne D.-F and Zhu, Xuding 1999. Distance Graphs andT-Coloring. Journal of Combinatorial Theory, Series B, Vol. 75, Issue. 2, p. 259.

Райгородский, Андрей Михайлович and Raigorodskii, Andrei Mikhailovich 2001. Проблема Борсука и хроматические числа некоторых метрических пространств. Успехи математических наук, Vol. 56, Issue. 1, p. 107.

Euler, Reinhardt 2004. Coloring planar Toeplitz graphs and the stable set polytope. Discrete Mathematics, Vol. 276, Issue. 1-3, p. 183.

Liu, Daphne Der‐Fen and Zhu, Xuding 2004. Fractional chromatic number and circular chromatic number for distance graphs with large clique size. Journal of Graph Theory, Vol. 47, Issue. 2, p. 129.

Райгородский, Андрей Михайлович and Raigorodskii, Andrei Mikhailovich 2005. Проблема Эрдеша - Хадвигера и хроматические числа конечных геометрических графов. Математический сборник, Vol. 196, Issue. 1, p. 123.

Bukh, Boris 2007. Measurable sets with excluded distances. Electronic Notes in Discrete Mathematics, Vol. 29, Issue. , p. 65.

Liu, Daphne Der-Fen 2008. FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS. Taiwanese Journal of Mathematics, Vol. 12, Issue. 4,

Kupavskii, A.B. and Raigorodskii, A.M. 2009. On the chromatic numbers of small-dimensional Euclidean spaces. Electronic Notes in Discrete Mathematics, Vol. 34, Issue. , p. 435.

Raigorodskii, A.M. and Rubanov, O.I. 2009. Small clique and large chromatic number. Electronic Notes in Discrete Mathematics, Vol. 34, Issue. , p. 441.

Download full list

Article contents

Problems for Solution

Abstract

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests