{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:23:55Z","timestamp":1772515435074,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":5818,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>When can a <jats:italic>k<\/jats:italic>\u2010edge\u2010coloring of a subgraph <jats:italic>K<\/jats:italic> of a graph <jats:italic>G<\/jats:italic> be extended to a <jats:italic>k<\/jats:italic>\u2010edge\u2010coloring of <jats:italic>G<\/jats:italic>? One necessary condition is that <jats:disp-formula>\n\n<\/jats:disp-formula> for all <jats:italic>X \u2286 E<\/jats:italic>(<jats:italic>G<\/jats:italic>) \u2010 <jats:italic>E<\/jats:italic>(<jats:italic>K<\/jats:italic>), where \u03bc<jats:sub>i<\/jats:sub>(<jats:italic>X<\/jats:italic>) is the maximum cardinality of a subset of <jats:italic>X<\/jats:italic> whose union with the set of edges of <jats:italic>K<\/jats:italic> colored <jats:italic>i<\/jats:italic> is a matching. This condition is not sufficient in general, but is sufficient for graphs of very simple structure. We try to locate the border where sufficiency ends.<\/jats:p>","DOI":"10.1002\/jgt.3190140508","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:50:41Z","timestamp":1180183841000},"page":"565-573","source":"Crossref","is-referenced-by-count":18,"title":["Extending an edge\u2010coloring"],"prefix":"10.1002","volume":"14","author":[{"given":"O.","family":"Marcotte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. D.","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210055"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-38.3.423"},{"key":"e_1_2_1_5_2","first-page":"368","volume-title":"Graph Theory and Related Topics","author":"Seymour P. D.","year":"1979"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:06:10Z","timestamp":1698001570000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["10.1002\/jgt.3190140508"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140508","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}