{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:40:12Z","timestamp":1648640412794},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:00:00Z","timestamp":1369094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00373-013-1317-9","type":"journal-article","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T05:53:29Z","timestamp":1369029209000},"page":"801-819","source":"Crossref","is-referenced-by-count":1,"title":["The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13"],"prefix":"10.1007","volume":"30","author":[{"given":"S.","family":"Akbari","sequence":"first","affiliation":[]},{"given":"M.","family":"Ghanbari","sequence":"additional","affiliation":[]},{"given":"M. J.","family":"Nikmehr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,21]]},"reference":[{"key":"1317_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":"1317_CR2","doi-asserted-by":"crossref","first-page":"P58","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. Electron. J. Comb. 19, P58 (2012)","journal-title":"Electron. J. Comb."},{"key":"1317_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North Holland, New York (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"1317_CR4","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. Electron. J. Comb. 10, R6 (2003)","journal-title":"Electron. J. Comb."},{"key":"1317_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(89)90005-1","volume":"46","author":"A.G. Chetwynd","year":"1989","unstructured":"Chetwynd A.G., Hilton A.J.W.: A \u0394-subgraph condition for a graph to be Class 1. J. Combin. Theory Ser. B. 46, 37\u201345 (1989)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1317_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(89)90082-4","volume":"75","author":"A.G. Chetwynd","year":"1989","unstructured":"Chetwynd A.G., Hilton A.J.W.: 1-factorizing regular graphs of high degree\u2014an improved bound. Discret. Math. 75, 103\u2013112 (1989)","journal-title":"Discret. Math."},{"key":"1317_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0963548300004211","volume":"9","author":"J.K. 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. Probab. Comput. 9, 97\u2013104 (2000)","journal-title":"Comb. Probab. Comput."},{"key":"1317_CR8","unstructured":"Fiorini, S., Wilson R.J.: Edge-Colourings of Graphs. Research Notes in Mathematics, Pitman (1977)"},{"key":"1317_CR9","first-page":"311","volume":"15","author":"J.-C. Fournier","year":"1973","unstructured":"Fournier J.-C.: Coloration des ar\u00eates d\u2019un graphe. Cahiers du CERO (Bruxelles) 15, 311\u2013314 (1973)","journal-title":"Cahiers du CERO (Bruxelles)"},{"key":"1317_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(89)90198-2","volume":"74","author":"A.J.W. Hilton","year":"1989","unstructured":"Hilton A.J.W.: Two conjectures on edge-colouring. Discrete Math. 74, 61\u201364 (1989)","journal-title":"Discrete Math."},{"issue":"6","key":"1317_CR11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1002\/jgt.3190170607","volume":"17","author":"A.J.W. 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":"1317_CR12","first-page":"97","volume":"21","author":"A.J.W. Hilton","year":"1996","unstructured":"Hilton A.J.W., Zhao C.: On the edge-colouring of graphs whose core has maximum degree two. J. Comb. Math. Comb. Comput. 21, 97\u2013108 (1996)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1317_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(92)90598-A","volume":"101","author":"A.J.W. 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":"1317_CR14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/jgt.3190200314","volume":"20","author":"D.G. 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":"1317_CR15","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. Comput. 10, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"1317_CR16","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."},{"key":"1317_CR17","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25\u201330 (1964) (in Russian)"},{"key":"1317_CR18","unstructured":"Vizing, V.G.: Critical graphs with a given chromatic class. Diskret. Analiz. 5, 6\u201317 (1965) (in Russian)"},{"key":"1317_CR19","doi-asserted-by":"crossref","first-page":"3733","DOI":"10.1016\/j.disc.2008.08.012","volume":"309","author":"L. Zhanga","year":"2009","unstructured":"Zhanga L., Shi W., Huanga X., Li G.: New results on chromatic index critical graphs. Discrete Math. 309, 3733\u20133737 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1317-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1317-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1317-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T22:39:02Z","timestamp":1595803142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1317-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,21]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["1317"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1317-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,21]]}}}