{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:39:10Z","timestamp":1778211550562,"version":"3.51.4"},"reference-count":8,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":4874,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1993,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erd\u00f6s and Ne\u0161et\u0159il: For each <jats:italic>d<\/jats:italic> \u2265 3, the edge set of a graph of maximum degree <jats:italic>d<\/jats:italic> can always be partitioned into [5<jats:italic>d<\/jats:italic><jats:sup>2<\/jats:sup>\/4] subsets each of which induces a matching. \u00a9 1993 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190170204","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T00:23:32Z","timestamp":1181262212000},"page":"151-160","source":"Crossref","is-referenced-by-count":96,"title":["Induced matchings in cubic graphs"],"prefix":"10.1002","volume":"17","author":[{"given":"Peter","family":"Hor\u00e1k","sequence":"first","affiliation":[]},{"given":"He","family":"Qing","sequence":"additional","affiliation":[]},{"given":"William T.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"L. D.Andersen The strong chromatic index of a cubic graph is at most 10.Ann. Discrete Math.To appear."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90275-F"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90144-7"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90196-3"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90163-5"},{"key":"e_1_2_1_7_2","unstructured":"R. T.Faudree A.Gy\u00e1rf\u00e1s R. H.Schelp andZ.Tuza The strong chromatic index of graphs. Submitted."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"e_1_2_1_9_2","unstructured":"P.Horak The strong chromatic index of graphs with maximum degree four. Submitted."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190170204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190170204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T03:56:52Z","timestamp":1696910212000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190170204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["10.1002\/jgt.3190170204"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190170204","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}