{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:09:21Z","timestamp":1768748961938,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T00:00:00Z","timestamp":1185580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T00:00:00Z","timestamp":1185580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10623-007-9100-7","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T16:46:57Z","timestamp":1185554817000},"page":"293-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On 3-chromatic distance-regular graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Aart","family":"Blokhuis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andries E.","family":"Brouwer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem H.","family":"Haemers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,28]]},"reference":[{"key":"9100_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02579429","volume":"2","author":"AE Brouwer","year":"1982","unstructured":"Brouwer AE (1982). The uniqueness of the near hexagon on 729 points. Combinatorica 2: 333\u2013340","journal-title":"Combinatorica"},{"key":"9100_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00181622","volume":"14","author":"AE Brouwer","year":"1983","unstructured":"Brouwer AE and Wilbrink HA (1983). The structure of near polygons with quads. Geom Dedicata 14: 145\u2013176","journal-title":"Geom Dedicata"},{"key":"9100_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-regular graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer AE, Cohen AM and Neumaier A (1989). Distance-regular graphs. Springer-Verlag, Berlin, Heidelbeg, Newyork"},{"key":"9100_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01264034","volume":"49","author":"AE Brouwer","year":"1994","unstructured":"Brouwer AE, Cohen AM, Hall JI and Wilbrink HA (1994). Near polygons and Fischer spaces. Geom Dedicata 49: 349\u2013368","journal-title":"Geom Dedicata"},{"key":"9100_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10623-004-4852-9","volume":"34","author":"K Coolsaet","year":"2005","unstructured":"Coolsaet K and Degraer J (2005). A computer-assisted proof of the uniqueness of the Perkel graph. Des Codes Cryptogr 34: 155\u2013171","journal-title":"Des Codes Cryptogr"},{"key":"9100_CR6","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H (1980) Spectra of graphs: theory and applications. Deutscher Verlag der Wissenschaften, Berlin; Academic Press, New York (Third edition, Johann Abrosius Barth Verlag, Heidelberg-Leipzig, 1995)"},{"key":"9100_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7643-7553-9","volume-title":"Near polygons","author":"B De Bruyn","year":"2006","unstructured":"De Bruyn B (2006). Near polygons. Birkh\u00e4user Verlag, Basel Boston Berlin"},{"key":"9100_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/B978-044488355-1\/50012-8","volume-title":"Some classes of rank 2 geometries: handbook of incidence geometry","author":"F De Clerck","year":"1995","unstructured":"De Clerck F and Van Maldeghem H (1995). Some classes of rank 2 geometries: handbook of incidence geometry. Elsevier, Amsterdam, pp, 433\u2013475"},{"key":"9100_CR9","unstructured":"De Wispelaere A (2005) Ovoids and spreads of finite classical generalized hexagons and applications. Ph.D. thesis, Ghent University"},{"key":"9100_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579374","volume":"5","author":"M El Zahar","year":"1985","unstructured":"El Zahar M and Sauer NW (1985). The chromatic number of the product of two 4-chromatic graphs is 4. Combinatorica 5: 121\u2013126","journal-title":"Combinatorica"},{"key":"9100_CR11","doi-asserted-by":"publisher","first-page":"3083","DOI":"10.1016\/j.disc.2004.03.023","volume":"306","author":"NC Fiala","year":"2006","unstructured":"Fiala NC, Haemers WH (2006) 5-chromatic strongly regular graphs. Discrete Math 306:3083\u20133096","journal-title":"Discrete Math"},{"key":"9100_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/eujc.1993.1045","volume":"14","author":"DG Fon-Der-Flaass","year":"1993","unstructured":"Fon-Der-Flaass DG (1993). There exists no distance-regular graph with intersection array (5,4,3;1,1,2). Eur J Combin 14: 409\u2013412","journal-title":"Eur J Combin"},{"key":"9100_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS and Stockmeyer LJ (1976). Some NP-complete graph problems. Theor Comput Sci 1: 237\u2013267","journal-title":"Theor Comput Sci"},{"key":"9100_CR14","unstructured":"Godsil CD (2004\u20132006) Interesting graphs and their colourings, unpublished notes 2004\u20132006. http:\/\/quoll.uwaterloo.ca\/pstuff\/colours.pdf"},{"key":"9100_CR15","unstructured":"Haemers WH (1979) Eigenvalue techniques in design and graph theory. Ph.D. thesis, Eindhoven University of Technology (http:\/\/alexandria.tue.nl\/extra3\/proefschrift\/PRF3A\/7909413.pdf) Also: Math Centre Tract 121, Mathematical Centre, Amsterdam, 1980"},{"key":"9100_CR16","first-page":"79","volume-title":"Graph theory and its applications","author":"AJ Hoffman","year":"1970","unstructured":"Hoffman AJ (1970). On eigenvalues and colorings of graphs. In: Harris, B (eds) Graph theory and its applications, pp 79\u201391. Acad. Press, New York"},{"key":"9100_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0195-6698(13)80139-4","volume":"11","author":"AA Ivanov","year":"1990","unstructured":"Ivanov AA and Shpectorov SV (1990). The P-geometry for M\n                  23 has no nontrivial 2-coverings. Eur. J Combin 11: 373\u2013379","journal-title":"Eur. J Combin"},{"key":"9100_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0012-365X(92)90319-B","volume":"103","author":"C Payan","year":"1992","unstructured":"Payan C (1992). On the chromatic number of cube-like graphs. Discrete Math 103: 271\u2013277","journal-title":"Discrete Math"},{"key":"9100_CR19","doi-asserted-by":"crossref","first-page":"308","DOI":"10.21136\/CPM.1987.118312","volume":"112","author":"M Sokolov\u00e1","year":"1987","unstructured":"Sokolov\u00e1 M (1987). The chromatic number of extended odd graphs is four.. \u010casopis P\u011bst Mat 112: 308\u2013311","journal-title":"\u010casopis P\u011bst Mat"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9100-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-007-9100-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9100-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9100-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T19:02:41Z","timestamp":1630436561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-007-9100-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,28]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9100"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9100-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,28]]},"assertion":[{"value":"30 November 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}