{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T18:11:20Z","timestamp":1698257480665},"reference-count":5,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4480,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A local (<jats:italic>H, k<\/jats:italic>)\u2010coloring of <jats:italic>K<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub> is a coloring of its edges in which each of its subgraphs isomorphic to <jats:italic>H<\/jats:italic> is colored by at most <jats:italic>k<\/jats:italic> colors. A necessary condition on <jats:italic>H<\/jats:italic> (conjectured to be sufficient) is found such that each local (<jats:italic>H, k<\/jats:italic>)\u2010coloring is a <jats:italic>k<\/jats:italic>\u2010coloring. Furthermore, necessary and sufficient conditions are given for each local (<jats:italic>H, k<\/jats:italic>)\u2010coloring to be a coloring by a bounded number of colors.<\/jats:p>","DOI":"10.1002\/jgt.3190180409","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T18:20:47Z","timestamp":1181240447000},"page":"389-399","source":"Crossref","is-referenced-by-count":0,"title":["Local edge colorings that are global"],"prefix":"10.1002","volume":"18","author":[{"given":"R. A.","family":"Clapsadle","sequence":"first","affiliation":[]},{"given":"R. H.","family":"Schelp","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"21","article-title":"On graphs which contain all sparse graphs","volume":"12","author":"Babai L.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_3_2","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"1986"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90017-7"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788549"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90049-4"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:21:57Z","timestamp":1698164517000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1002\/jgt.3190180409"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180409","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}