{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:35:28Z","timestamp":1699835728136},"reference-count":3,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9528,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1980,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>If a graph <jats:italic>G<\/jats:italic> has no induced subgraph isomorphic to <jats:italic>K<\/jats:italic><jats:sub>1,3\u2032<\/jats:sub> <jats:italic>K<\/jats:italic><jats:sub>5<\/jats:sub>\u2010<jats:italic>e<\/jats:italic>, or a third graph that can be selected from two specific graphs, then the chromatic number of <jats:italic>G<\/jats:italic> is either <jats:italic>d<\/jats:italic> or <jats:italic>d<\/jats:italic> + 1, where <jats:italic>d<\/jats:italic> is the maximum order of a clique in <jats:italic>G<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/jgt.3190040303","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T10:48:25Z","timestamp":1180176505000},"page":"265-267","source":"Crossref","is-referenced-by-count":9,"title":["Note on Choudum's \u201cchromatic bounds for a class of graphs\u201d"],"prefix":"10.1002","volume":"4","author":[{"given":"Medha","family":"Javdekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"17","volume-title":"Beitr\u00e4ge zur Graphen\u2010Theoria","author":"Beineke L. W.","year":"1968"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.3.257"},{"key":"e_1_2_1_4_2","first-page":"25","article-title":"On an estimate of the chromatic number of a p\u2010graph","volume":"3","author":"Vizing V. G.","year":"1964","journal-title":"Diskret. Anal."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190040303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190040303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:19:06Z","timestamp":1699777146000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190040303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["10.1002\/jgt.3190040303"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190040303","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}