{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T21:41:04Z","timestamp":1698010864335},"reference-count":7,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6182,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,11]]},"abstract":"Abstract<\/jats:title>We show that a graph G<\/jats:italic> on n \u2a7e q<\/jats:italic> + 1 vertices (where q<\/jats:italic> \u2a7e 2) has the chromatic polynomial P(G;\u03bb) = \u03bb(\u03bb \u2212 1) \u2026 (\u03bb \u2212 q<\/jats:italic> + 2) (\u03bb \u2212 q<\/jats:italic> + 1)2<\/jats:sup> (\u03bb \u2212 q)n\u2212q\u22121<\/jats:sup> if and only if G<\/jats:italic> can be obtained from a q<\/jats:italic>\u2010tree T<\/jats:italic>on n<\/jats:italic> vertices by deleting an edge contained in exactly q<\/jats:italic> \u2212 1 triangles of T.<\/jats:italic> Furthermore, we prove that these graphs are triangulated.<\/jats:p>","DOI":"10.1002\/jgt.3190130510","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T18:17:15Z","timestamp":1181326635000},"page":"597-605","source":"Crossref","is-referenced-by-count":6,"title":["On the chromaticity of certain subgraphs of a q\u2010tree"],"prefix":"10.1002","volume":"13","author":[{"given":"Thomas","family":"Wanner","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100116"},{"key":"e_1_2_1_3_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80087-0"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120215"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090209"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080305"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:21:15Z","timestamp":1697941275000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["10.1002\/jgt.3190130510"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130510","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}