{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:32:42Z","timestamp":1699835562311},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9255,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that if <jats:italic>K<\/jats:italic> is an undirected, simple, connected graph of even order which is of class one, regular of degree <jats:italic>p<\/jats:italic> \u2265 2 and such that the subgraph induced by any three vertices is either connected or null, then any graph <jats:italic>G<\/jats:italic> obtained from <jats:italic>K<\/jats:italic> by splitting any vertex is <jats:italic>p<\/jats:italic>\u2010critical. We find that various constructions of critical graphs by S. Fiorini are special cases of a corollary of this result.<\/jats:p>","DOI":"10.1002\/jgt.3190050205","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T10:50:28Z","timestamp":1180176628000},"page":"159-163","source":"Crossref","is-referenced-by-count":5,"title":["A construction of chromatic index critical graphs"],"prefix":"10.1002","volume":"5","author":[{"given":"Hian Poh","family":"Yap","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","doi-asserted-by":"crossref","unstructured":"S.Fiorini The Chromatic Index of Simple Graphs. Doctoral thesis The Open University England (1974).","DOI":"10.1017\/CBO9780511662072.008"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"S.FioriniandR. J.Wilson On the chromatic index of a graph II. Combinatorics. Edited by T. P. McDonough and V. C. Mavron. L. M. S. Lecture Notes No. 13 Cambridge (1974)37\u201351.","DOI":"10.1017\/CBO9780511662072.008"},{"key":"e_1_2_1_4_2","volume-title":"Edge\u2010Colourings of Graphs","author":"Fiorini S.","year":"1977"},{"key":"e_1_2_1_5_2","first-page":"29","article-title":"On graphs of (maximum) degree 3 with chromatic index 4 (Russian)","volume":"93","author":"Gol'berg M. K.","year":"1979","journal-title":"Bull. Acad. Sci. Georgian SSR"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90009-0"},{"key":"e_1_2_1_7_2","unstructured":"V. G.Vizing Critical graphs with a given chromatic class (Russian).Diskret. Analiz(1965)9\u201317."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190050205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190050205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T06:28:10Z","timestamp":1699770490000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190050205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/jgt.3190050205"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190050205","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}