{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:49:43Z","timestamp":1774626583173,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1249-9","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T08:57:58Z","timestamp":1351673878000},"page":"71-81","source":"Crossref","is-referenced-by-count":3,"title":["On the Chromatic Number of Subsets of the Euclidean Plane"],"prefix":"10.1007","volume":"30","author":[{"given":"M.","family":"Axenovich","sequence":"first","affiliation":[]},{"given":"J.","family":"Choi","sequence":"additional","affiliation":[]},{"given":"M.","family":"Lastrina","sequence":"additional","affiliation":[]},{"given":"T.","family":"McKay","sequence":"additional","affiliation":[]},{"given":"J.","family":"Smith","sequence":"additional","affiliation":[]},{"given":"B.","family":"Stanton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,1]]},"reference":[{"issue":"1","key":"1249_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/(SICI)1097-0118(199809)29:1<17::AID-JGT3>3.0.CO;2-H","volume":"29","author":"B.L. Bauslaugh","year":"1998","unstructured":"Bauslaugh B.L.: Tearing a strip off the plane. J. Graph Theory 29(1), 17\u201333 (1998)","journal-title":"J. Graph Theory"},{"key":"1249_CR2","first-page":"87","volume":"2","author":"I. Boreico","year":"2008","unstructured":"Boreico I.: My favorite problem: linear independence of radicals. Harv. Coll. Math. Rev. 2, 87\u201392 (2008)","journal-title":"Harv. Coll. Math. Rev."},{"issue":"1","key":"1249_CR3","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1006\/jcta.2000.3133","volume":"94","author":"P. Bra\u00df","year":"2001","unstructured":"Bra\u00df P., Pach J.: The maximum number of times the same distance can occur among the vertices of a convex n-gon is O(nlog n). J. Combin. Theory Ser. A 94(1), 178\u2013179 (2001)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1249_CR4","first-page":"39","volume":"8","author":"K.B. Chilakamarri","year":"1993","unstructured":"Chilakamarri K.B.: The unit-distance graph problem: a brief survey and some new results. Bull. Inst. Combin. Appl. 8, 39\u201360 (1993)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1249_CR5","unstructured":"de Bruijn, N.G., Erd\u0151s, P.: A colour problem for infinite graphs and a problem in the theory of relations. em Nederl. Akad. Wetensch. Proc. Ser. A. vol. 54. Indagationes Math. 13, 369\u2013373 (1951)"},{"issue":"2","key":"1249_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0097-3165(91)90042-F","volume":"56","author":"P. Edelsbrunner","year":"1991","unstructured":"Edelsbrunner P., Hajnal H.: A lower bound on the number of unit distances between the vertices of a convex polygon. J. Combin. Theory Ser. A 56(2), 312\u2013316 (1991)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1249_CR7","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Fishburn, P.C.: Multiplicities of interpoint distances in finite planar sets. Discrete Appl. Math. 60(1\u20133), 141\u2013147 (1995) (ARIDAM VI and VII (New Brunswick, NJ, 1991\/1992))","DOI":"10.1016\/0166-218X(94)00046-G"},{"key":"1249_CR8","doi-asserted-by":"crossref","unstructured":"Erd\u0151s P., Moser, L.: Problem 11. Can. Math. Bull. 2, 43 (1959)","DOI":"10.4153\/CMB-1959-003-0"},{"issue":"2","key":"1249_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(90)90324-B","volume":"82","author":"K.G. Fischer","year":"1990","unstructured":"Fischer K.G.: Additive K colorable extensions of the rational plane. Discrete Math. 82(2), 181\u2013195 (1990)","journal-title":"Discrete Math."},{"issue":"2","key":"1249_CR10","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/0097-3165(90)90074-7","volume":"55","author":"Z.F. F\u00fcredi","year":"1990","unstructured":"F\u00fcredi Z.F.: The maximum number of unit distances in a convex n-gon. J. Combin. Theory Ser. 55(2), 316\u2013320 (1990)","journal-title":"J. Combin. Theory Ser."},{"key":"1249_CR11","unstructured":"Johnson, Jr. P.D.: Two-colorings of real quadratic extensions of Q 2 that forbid many distances. Congr. Numer. 60, 51\u201358 (1987). Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1987)."},{"key":"1249_CR12","unstructured":"Klazar, M.: A question on linear independence of square roots (Unpublished)"},{"issue":"4","key":"1249_CR13","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.jcss.2007.06.003","volume":"74","author":"C.P. Kruskal","year":"2008","unstructured":"Kruskal C.P.: The chromatic number of the plane: the bounded case. J. Comput. Syst. Sci. 74(4), 598\u2013627 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"1249_CR14","unstructured":"Moorehouse, G.E.: On the chromatic numbers of planes (Preprint)"},{"key":"1249_CR15","unstructured":"Pritikin, D.: All unit-distance graphs of order 6197 are 6-colorable. J. Combin. Theory Ser. B 73(2), 159\u2013163 (1998)"},{"key":"1249_CR16","doi-asserted-by":"crossref","unstructured":"Soifer, A.: The mathematical coloring book. Springer, New York (2009) (Mathematics of coloring and the colorful life of its creators, With forewords by Branko Gr\u00fcnbaum, Peter D. Johnson, Jr. and Cecil Rousseau)","DOI":"10.1007\/978-0-387-74642-5"},{"key":"1249_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0097-3165(73)90020-4","volume":"14","author":"D.R. Woodall","year":"1973","unstructured":"Woodall D.R.: Distances realizes by sets covering the plane. J. Combin. Theory Ser. A 14, 187\u2013200 (1973)","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1249-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1249-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1249-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T09:28:26Z","timestamp":1594805306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1249-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1249"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1249-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,1]]}}}