{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:44:38Z","timestamp":1772793878522,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T00:00:00Z","timestamp":1397260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00373-014-1417-1","type":"journal-article","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:23:15Z","timestamp":1397247795000},"page":"805-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree $$2$$ 2"],"prefix":"10.1007","volume":"31","author":[{"given":"S.","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ghanbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,12]]},"reference":[{"key":"1417_CR1","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1016\/j.disc.2011.09.035","volume":"312","author":"S Akbari","year":"2012","unstructured":"Akbari, S., Cariolaro, D., Chavoshi, M., Ghanbari, M., Zare, S.: Some Criteria for a graph to be Class 1. Discrete Math. 312, 2593\u20132598 (2012)","journal-title":"Discrete Math."},{"key":"1417_CR2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.37236\/2101","volume":"19","author":"S Akbari","year":"2012","unstructured":"Akbari, S., Ghanbari, M., Kano, M., Nikmehr, M.J.: The chromatic index of a graph whose core has maximum degree 2. Electr. J. Comb. 19, 58 (2012)","journal-title":"Electr. J. Comb."},{"key":"1417_CR3","doi-asserted-by":"crossref","first-page":"R6","DOI":"10.37236\/1699","volume":"10","author":"D Cariolaro","year":"2003","unstructured":"Cariolaro, D., Cariolaro, G.: Colouring the petals of a graph. Electr. J. Comb. 10, R6 (2003)","journal-title":"Electr. J. Comb."},{"key":"1417_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(89)90005-1","volume":"46","author":"AG Chetwynd","year":"1989","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: A $$\\Delta $$ \u0394 -subgraph condition for a graph to be Class 1. J. Comb. Theory Ser. B 46, 37\u201345 (1989)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1417_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(89)90082-4","volume":"75","author":"AG Chetwynd","year":"1989","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: 1-factorizing regular graphs of high degree an improved bound. Discrete Math. 75, 103\u2013112 (1989)","journal-title":"Discrete Math."},{"key":"1417_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0963548300004211","volume":"9","author":"JK Dugdale","year":"2000","unstructured":"Dugdale, J.K., Hilton, A.J.W.: A sufficient condition for a graph to be the core of a Class 1 graph. Comb. Prob. Comput. 9, 97\u2013104 (2000)","journal-title":"Comb. Prob. Comput."},{"key":"1417_CR7","volume-title":"Edge-colourings of graphs","author":"S Fiorini","year":"1977","unstructured":"Fiorini, S., Wilson, R.J.: Edge-colourings of graphs. Research Notes in Mathematics, Pitman (1977)"},{"key":"1417_CR8","first-page":"311","volume":"15","author":"J-C Fournier","year":"1973","unstructured":"Fournier, J.-C.: Coloration des aretes dun graphe. Cahiers du CERO (Bruxelles) 15, 311\u2013314 (1973)","journal-title":"Cahiers du CERO (Bruxelles)"},{"issue":"6","key":"1417_CR9","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1002\/jgt.3190170607","volume":"17","author":"AJW Hilton","year":"1993","unstructured":"Hilton, A.J.W., Zhao, C.: A sufficient condition for a regular graph to be Class 1. J. Graph Theory 17(6), 701\u2013712 (1993)","journal-title":"J. Graph Theory"},{"key":"1417_CR10","first-page":"97","volume":"21","author":"AJW Hilton","year":"1996","unstructured":"Hilton, A.J.W., Zhao, C.: On the edge-colouring of graphs whose core has maximum degree two. JCMCC 21, 97\u2013108 (1996)","journal-title":"JCMCC"},{"key":"1417_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(92)90598-A","volume":"101","author":"AJW Hilton","year":"1992","unstructured":"Hilton, A.J.W., Zhao, C.: The chromatic index of a graph whose core has maximum degree two. Discrete Math. 101, 135\u2013147 (1992)","journal-title":"Discrete Math."},{"key":"1417_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(89)90198-2","volume":"74","author":"AJW Hilton","year":"1989","unstructured":"Hilton, A.J.W.: Two conjectures on edge-colouring. Discrete Math. 74, 61\u201364 (1989)","journal-title":"Discrete Math."},{"key":"1417_CR13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/jgt.3190200314","volume":"20","author":"DG Hoffman","year":"1995","unstructured":"Hoffman, D.G.: Cores of Class II graphs. J. Graph Theory 20, 397\u2013402 (1995)","journal-title":"J. Graph Theory"},{"key":"1417_CR14","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-colouring. SIAM J. Comp. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comp."},{"key":"1417_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s00373-005-0610-7","volume":"21","author":"Z Song","year":"2005","unstructured":"Song, Z., Yap, H.P.: Chromatic index critical graphs of even order with five major vertices. Graph Comb. 21, 239\u2013246 (2005)","journal-title":"Graph Comb."},{"issue":"1","key":"1417_CR16","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"DP Sumner","year":"1974","unstructured":"Sumner, D.P.: Graphs with 1-factors. Proc. Am. Math. Soc. 42(1), 8\u201312 (1974)","journal-title":"Proc. Am. Math. Soc."},{"key":"1417_CR17","first-page":"6","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with a given chromatic class. Diskret. Anal. 5, 6\u201317 (1965). (in Russian)","journal-title":"Diskret. Anal."},{"key":"1417_CR18","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$ p -graph. Diskret. Anal. 3, 25\u201330 (1964). (in Russian)","journal-title":"Diskret. Anal."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1417-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1417-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1417-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:42:03Z","timestamp":1648816923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1417-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1417"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1417-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,12]]}}}