{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:46:52Z","timestamp":1777564012581,"version":"3.51.4"},"reference-count":5,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5490,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1993,9]]},"abstract":"<jats:p>Let<jats:italic>G<\/jats:italic>be a graph and<jats:italic>P<\/jats:italic>(<jats:italic>G, t<\/jats:italic>) be the chromatic polynomial of<jats:italic>G<\/jats:italic>. It is known that<jats:italic>P<\/jats:italic>(<jats:italic>G, t<\/jats:italic>) has no zeros in the intervals (\u2212\u221e, 0) and (0, 1). We shall show that<jats:italic>P<\/jats:italic>(<jats:italic>G, t<\/jats:italic>) has no zeros in (1, 32\/27]. In addition, we shall construct graphs whose chromatic polynomials have zeros arbitrarily close to 32\/27.<\/jats:p>","DOI":"10.1017\/s0963548300000705","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:18:58Z","timestamp":1221218338000},"page":"325-336","source":"Crossref","is-referenced-by-count":63,"title":["A Zero-Free Interval for Chromatic Polynomials of Graphs"],"prefix":"10.1017","volume":"2","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000705_ref002","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"Tutte","year":"1966"},{"key":"S0963548300000705_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90614-L"},{"key":"S0963548300000705_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066197"},{"key":"S0963548300000705_ref004","first-page":"199","volume-title":"Combinatorial Surveys, Proc. Sixth British Combinatorial Conference","author":"Woodall","year":"1977"},{"key":"S0963548300000705_ref001","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1946-0018401-4"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T06:57:48Z","timestamp":1588921068000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000705\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["S0963548300000705"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000705","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}