{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:44:58Z","timestamp":1700160298155},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2003,11,26]],"date-time":"2003-11-26T00:00:00Z","timestamp":1069804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2004,1]]},"abstract":"Abstract<\/jats:title>It is proved that, if s<\/jats:italic> \u2265 2, a graph that does not have K<\/jats:italic>2<\/jats:sub>\u2009+\u2009K<\/jats:italic><\/jats:styled-content>s<\/jats:italic><\/jats:sub>\u2009=\u2009K<\/jats:italic>1<\/jats:sub>\u2009+\u2009K<\/jats:italic>1, s<\/jats:italic><\/jats:sub> as a minor is (s<\/jats:italic>,\u20021)*\u2010choosable. This completes the proof that such a graph is (s<\/jats:italic>\u2009+\u20091\u2009\u2212\u2009d<\/jats:italic>,d<\/jats:italic>)*\u2010choosable whenever 0\u2009\u2264\u2009d<\/jats:italic>\u2009\u2264\u2009s<\/jats:italic>\u2009\u22121 \u00a9 2003 Wiley Periodicals, Inc. J Graph Theory 45: 51\u201356, 2004<\/jats:p>","DOI":"10.1002\/jgt.10153","type":"journal-article","created":{"date-parts":[[2003,12,2]],"date-time":"2003-12-02T14:26:46Z","timestamp":1070375206000},"page":"51-56","source":"Crossref","is-referenced-by-count":5,"title":["Defective choosability of graphs with no edge\u2010plus\u2010independent\u2010set minor"],"prefix":"10.1002","volume":"45","author":[{"given":"Douglas R.","family":"Woodall","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,12,15]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00104-5"},{"key":"e_1_2_1_3_2","first-page":"15","article-title":"A small non\u20104\u2010choosable planar graph","volume":"17","author":"Mirzakhani M.","year":"1996","journal-title":"Bull Inst Combin Appl"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90579-I"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"D. R.Woodall List colourings of graphs Surveys in Combinatorics 2001.","DOI":"10.1017\/CBO9780511721328.012"},{"key":"e_1_2_1_5_3","first-page":"269","volume-title":"London Math Soc. Lecture Note Series 288","author":"Hirschfeld J. W. P.","year":"2001"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.10153","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.10153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:09:37Z","timestamp":1700158177000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.10153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12,15]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["10.1002\/jgt.10153"],"URL":"https:\/\/doi.org\/10.1002\/jgt.10153","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12,15]]}}}