{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:35:05Z","timestamp":1780392905055,"version":"3.54.1"},"reference-count":131,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11871239"],"award-info":[{"award-number":["11871239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00373-018-1986-5","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T04:25:22Z","timestamp":1546575922000},"page":"33-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Graph Edge Coloring: A Survey"],"prefix":"10.1007","volume":"35","author":[{"given":"Yan","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guantao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0157-2687","authenticated-orcid":false,"given":"Guangming","family":"Jing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bjarne","family":"Toft","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,4]]},"reference":[{"key":"1986_CR1","doi-asserted-by":"crossref","unstructured":"Akbari, S., Ghanbari, M., Kano, M., Nikmehr, M.J.: The chromatic index of a graph whose core has maximum degree $$2$$ 2 . Electron. J. Comb. 19, #P58 (2012)","DOI":"10.37236\/2101"},{"key":"1986_CR2","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00373-013-1317-9","volume":"30","author":"S Akbari","year":"2014","unstructured":"Akbari, S., Ghanbari, M., Nikmehr, M.J.: The chromatic index of a graph whose core is a cycle of order at most $$13$$ 13 . Graphs Comb. 30, 801\u2013819 (2014)","journal-title":"Graphs Comb."},{"key":"1986_CR3","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00373-014-1417-1","volume":"31","author":"S Akbari","year":"2015","unstructured":"Akbari, S., Ghanbari, M., Ozeki, K.: The chromatic index of a claw-free graph whose core has maximum degree $$2$$ 2 . Graphs Comb. 31, 805\u2013811 (2015)","journal-title":"Graphs Comb."},{"key":"1986_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7146\/math.scand.a-11685","volume":"40","author":"LD Andersen","year":"1975","unstructured":"Andersen, L.D.: On edge-colourings of graphs. Math. Scand. 40, 161\u2013175 (1975)","journal-title":"Math. Scand."},{"key":"1986_CR5","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1016\/j.disc.2016.03.025","volume":"339","author":"J Asplund","year":"2016","unstructured":"Asplund, J., McDonald, J.: On a limit of the method of Tashkinov trees for edge-colouring. Discrete Math. 339, 2231\u20132238 (2016)","journal-title":"Discrete Math."},{"key":"1986_CR6","first-page":"37","volume":"14","author":"S Bej","year":"2017","unstructured":"Bej, S., Steffen, E.: Factors of edge-chromatic critical graphs: a brief survey and some equivalences. Lect. Notes Semin. Interdiscip. Mat. 14, 37\u201348 (2017)","journal-title":"Lect. Notes Semin. Interdiscip. Mat."},{"key":"1986_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disc.2014.02.014","volume":"325","author":"SM Belcastro","year":"2014","unstructured":"Belcastro, S.M., Haas, R.: Counting edge-Kempe-equivalence classes for $$3$$ 3 -edge-colored cubic graphs. Discrete Math. 325, 77\u201384 (2014)","journal-title":"Discrete Math."},{"key":"1986_CR8","first-page":"197","volume":"62","author":"SM Belcastro","year":"2017","unstructured":"Belcastro, S.M., Haas, R.: Edge-Kempe-equivalence graphs of class- $$1$$ 1 regular graphs. Aust. J. Comb. 62, 197\u20132014 (2017)","journal-title":"Aust. J. Comb."},{"key":"1986_CR9","unstructured":"Bismarck de Sousa Cruz, J., Nunes da Silva, C., Morais de Almeida, S.: The overfull ocnjecture on split-comparability graphs (2017). arXiv:1710.03524v1 [math.CO] (manuscript; 10 Oct 2017)"},{"key":"1986_CR10","doi-asserted-by":"crossref","unstructured":"Bruhn, H., Gellert, L., Lang, R.: Chromatic index, treewidth and maximum degree. Electron. J. Comb. 25, #P2.23 (2018)","DOI":"10.37236\/6042"},{"key":"1986_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","volume":"30","author":"J Cai","year":"1991","unstructured":"Cai, J., Ellis, J.A.: NP-completeness of edge-colouring some restricted graphs. Discrete Appl. Math. 30, 15\u201327 (1991)","journal-title":"Discrete Appl. Math."},{"key":"1986_CR12","unstructured":"Cao, Y., Chen, G.: Lower bound of the average degree of a $$\\varDelta $$ \u0394 -critical graph (2018) (Manuscript )"},{"key":"1986_CR13","unstructured":"Cao, Y., Chen, G., Jiang, S., Liu, H., Lu, F.: Average degree of edge-chromatic critical graphs (2017). arXiv:1708.01279v1 [math.CO] (Manuscript; 3 Aug 2017)"},{"key":"1986_CR14","unstructured":"Cao, C., Chen, G., Jiang, S., Liu, H., Lu, F.: Hamiltonicity of edge-chromatic critical graphs (2017). arXiv:1708.08921v1 [math.CO] (manuscript; 29 Aug 2017)"},{"key":"1986_CR15","unstructured":"Cao, C., Chen, G., Jing, G., Shan, S.: Independence number of edge-chromatic critical graphs (2018). arXiv:1805.05996v1 [math.CO] (manuscript ; 15 May 2018)"},{"key":"1986_CR16","doi-asserted-by":"crossref","unstructured":"Cariolaro, D., Cariolaro, G.: Colouring the petals of a graph. Electron. J. Comb. 10, #R6 (2003)","DOI":"10.37236\/1699"},{"key":"1986_CR17","doi-asserted-by":"publisher","first-page":"3011","DOI":"10.1016\/j.disc.2017.07.013","volume":"340","author":"G Chen","year":"2016","unstructured":"Chen, G., Chen, X., Zhao, Y.: Hamiltonicity of edge chromatic critical graphs. Discrete Math. 340, 3011\u20133015 (2016)","journal-title":"Discrete Math."},{"key":"1986_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jctb.2018.01.006","volume":"131","author":"G Chen","year":"2018","unstructured":"Chen, G., Gao, Y., Kim, R., Postle, L., Shan, S.: Chromatic index determined by fractional chromatic index. J. Comb. Theory Ser. B 131, 85\u2013108 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR19","unstructured":"Chen, G., Jing, G.: Structural properties of edge-chromatic critical graphs (2017). arXiv:1709.04568v1 [math.CO] (manuscript ; 14 Sep 2017)"},{"key":"1986_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1002\/jgt.22135","volume":"86","author":"G Chen","year":"2017","unstructured":"Chen, G., Shan, S.: Vizings 2-factor conjecture involving large maximum degree. J. Graph Theory 86, 422\u2013438 (2017)","journal-title":"J. Graph Theory"},{"key":"1986_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10878-009-9232-y","volume":"21","author":"G Chen","year":"2011","unstructured":"Chen, G., Yu, X., Zang, W.: Approximating the chromatic index of multigraphs. J. Comb. Optim. 21, 219\u2013246 (2011)","journal-title":"J. Comb. Optim."},{"key":"1986_CR22","unstructured":"Chen, X., Zang, W., Zhao, Q.: Densities, matchings, and fractional edge-colorings. SIAM J. Optim. http:\/\/hkumath.hku.hk\/~imr\/IMRPreprintSeries\/2018\/IMR2018-14.pdf"},{"key":"1986_CR23","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1016\/j.disc.2016.04.013","volume":"339","author":"J Cheng","year":"2016","unstructured":"Cheng, J., Lorenzen, K.J., Luo, R., Thompson, J.: A note on the size of edge-chromatic $$4$$ 4 -critical graphs. Discrete Math. 339, 2393\u20132398 (2016)","journal-title":"Discrete Math."},{"key":"1986_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/plms\/s3-50.2.193","volume":"50","author":"AG Chetwynd","year":"1985","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: Regular graphs of high degree are 1-factorizable. Proc. Lond. Math. Soc. 50, 193\u2013206 (1985)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1986_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S030500410006610X","volume":"100","author":"AG Chetwynd","year":"1986","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: Star multigraphs with three vertices of maximum degree. Math. Proc. Camb. Philos. Soc. 100, 303\u2013317 (1986)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"1986_CR26","doi-asserted-by":"publisher","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\u2014an improved bound. Discrete Math. 75, 103\u2013112 (1989)","journal-title":"Discrete Math."},{"key":"1986_CR27","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.jctb.2014.11.005","volume":"115","author":"M Chudnovsky","year":"2015","unstructured":"Chudnovsky, M., Edwards, K., Kawarabayashi, K., Seymour, P.: Edge-colouring seven-regular planar graphs. J. Comb. Theory Ser. B 115, 276\u2013302 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR28","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jctb.2015.05.002","volume":"115","author":"M Chudnovsky","year":"2015","unstructured":"Chudnovsky, M., Edwards, K., Seymour, P.: Edge-colouring eight-regular planar graphs. J. Comb. Theory Ser. B 115, 303\u2013338 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR29","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1002\/jgt.22116","volume":"86","author":"DW Cranston","year":"2017","unstructured":"Cranston, D.W., Rabern, L.: Subcubic edge chromatic index critcal graphs have many edges. J. Graph Theory 86, 122\u2013136 (2017)","journal-title":"J. Graph Theory"},{"key":"1986_CR30","unstructured":"Cranston, D.W., Rabern, L.: Short, : fans and the $$5\/6$$ 5 \/ 6 bound for line graphs (2016). arXiv:1610.03924v1 [math.CO] (manuscript; 13 Oct, 2016)"},{"key":"1986_CR31","unstructured":"Cranston, D.W., Rabern, L.: The Hilton-Zhao conjecture is true for graphs with maximum degree 4 (2017). arXiv:1703.009594v1 [math.CO] (manuscript; 2 Mar 2018)"},{"key":"1986_CR32","first-page":"v+164","volume":"244","author":"B Csaba","year":"2016","unstructured":"Csaba, B., K\u00fchn, D., Lo, A., Osthus, D., Treglown, A.: Proof of the $$1$$ 1 -factorization and Hamilton decomposition conjectures. Mem. Am. Soc. 244, v+164 (2016)","journal-title":"Mem. Am. Soc."},{"key":"1986_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jctb.2015.09.002","volume":"116","author":"Z Dvo\u0159\u00e1k","year":"2016","unstructured":"Dvo\u0159\u00e1k, Z., Kawarabayashi, K., Kr\u00e1l\u2019, D.: Packing six $$T$$ T -joins in plane graphs. J. Comb. Theory Ser. B 116, 287\u2013305 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0\u20131 vertices. J. Res. Nat. Bur. Stand. Sect. B 69 B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Stand. Sect. B"},{"key":"1986_CR35","unstructured":"Edwards, K.: Optimization and packing of $$T$$ T -joins and $$T$$ T -cuts in plane graphs. M.Sc. thesis, McGill University (2011)"},{"key":"1986_CR36","doi-asserted-by":"crossref","unstructured":"Edwards, K., Gir\u00e3o, A., van den Heuvel, J., Kang, R.J., Puleo, G.J., Sereni, J.-S.: Extension from precolored sets of edges. Electron. J. Comb. 25, #P3.1 (2018)","DOI":"10.37236\/6303"},{"key":"1986_CR37","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jctb.2015.12.006","volume":"119","author":"K Edwards","year":"2016","unstructured":"Edwards, K., Sanders, D.P., Seymour, P., Thomas, R.: Three-edge-colouring doublecross cubic graphs. J. Comb. Theory Ser. B 119, 66\u201395 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR38","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0095-8956(77)90039-9","volume":"23","author":"P Erd\u0151s","year":"1977","unstructured":"Erd\u0151s, P., Wilson, R.J.: On the chromatic index of almost all graphs. J. Comb. Theory Ser. B 23, 255\u2013257 (1977)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR39","unstructured":"Favrholdt, L.M., Stiebitz, M., Toft, B.: Graph Edge Colouring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture. Techn. rep, DMF-2006-10-003, IMADA-PP-2006-20, University of Southern Denmark (2006) (preprint)"},{"key":"1986_CR40","first-page":"79","volume":"32","author":"CMH Figueiredo De","year":"2000","unstructured":"De Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: Local conditions for edge-colouring. J. Comb. Math. Comb. Comput. 32, 79\u201391 (2000)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1986_CR41","volume-title":"Edge-Colourings of Graphs. Research Notes in Mathematics","author":"S Fiorini","year":"1977","unstructured":"Fiorini, S., Wilson, R.J.: Edge-Colourings of Graphs. Research Notes in Mathematics, vol. 16. Pitman, London (1977)"},{"key":"1986_CR42","first-page":"311","volume":"15","author":"JC Fournier","year":"1973","unstructured":"Fournier, J.C.: Coloration des ar\u00eates d\u2019un graphe. Cahiers Centre \u00c9tudes Recherche Op\u00e9r. 15, 311\u2013314 (1973)","journal-title":"Cahiers Centre \u00c9tudes Recherche Op\u00e9r."},{"key":"1986_CR43","unstructured":"Gir\u00e3o, A., Kang, R.J.: Precolouring extension of Vizings theorem (2016). arXiv:1611.09002v1 [math.CO] (manuscript; 28 Nov 2016)"},{"key":"1986_CR44","first-page":"3","volume":"23","author":"MK Goldberg","year":"1973","unstructured":"Goldberg, M.K.: On multigraphs of almost maximal chromatic class (Russian). Diskret. Anal. 23, 3\u20137 (1973)","journal-title":"Diskret. Anal."},{"key":"1986_CR45","first-page":"3","volume":"30","author":"MK Goldberg","year":"1977","unstructured":"Goldberg, M.K.: Structure of multigraphs with restriction on the chromatic class (Russian). Diskret. Anal. 30, 3\u201312 (1977)","journal-title":"Diskret. Anal."},{"key":"1986_CR46","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jgt.3190080115","volume":"8","author":"MK Goldberg","year":"1984","unstructured":"Goldberg, M.K.: Edge-coloring of multigraphs: recoloring technique. J. Graph Theory 8, 123\u2013137 (1984)","journal-title":"J. Graph Theory"},{"key":"1986_CR47","unstructured":"Gr\u00fcnewald, S.: Chromatic index critical graphs and multigraphs. Doctoral thesis, Universit\u00e4t Bielefeld, Bielefeld (2000)"},{"key":"1986_CR48","unstructured":"Guenin, B.: Packing $$T$$ T -joins and edge-colouring in planar graphs (2018) (manuscript in preparation)"},{"key":"1986_CR49","unstructured":"Gupta., R.G.: Studies in the theory of graphs. Ph.D. thesis, Tata Institute of Fundamental Research, Bombay (1967)"},{"key":"1986_CR50","doi-asserted-by":"crossref","unstructured":"Gupta, R.P.: On the chromatic index and the cover index of a multigraph. In: Donald, A., Eckmann, B. (eds.) Theory and Applications of Graphs, Proceedings, Michigan May 11\u201315, 1976. Lecture Notes in Mathematics, vol. 642, pp 204\u2013215. Springer, Berlin, Heidelberg (1978)","DOI":"10.1007\/BFb0070378"},{"key":"1986_CR51","unstructured":"Harrelson, J., McDonald, J., Puleo, G.J.: List-edge-colouring planar graphs with precoloured edges (2018). arXiv:1709.04027v3 [math.CO] (manuscript; 9 Jul 2018)"},{"key":"1986_CR52","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1016\/j.disc.2015.06.022","volume":"338","author":"P Haxell","year":"2015","unstructured":"Haxell, P., Kierstaed, H.A.: Edge coloring multigraphs without small dense subsets. Discrete Math. 338, 2502\u20132506 (2015)","journal-title":"Discrete Math."},{"key":"1986_CR53","unstructured":"Haxell, P., Krivelevich, M., Kronenberg, G.: Goldberg\u2019s conjecture is true for random multigraphs (2018). arXiv:1803.00908v1 [math.CO] (manuscript; 2 Mar 2018)"},{"key":"1986_CR54","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1002\/jgt.20571","volume":"69","author":"P Haxell","year":"2012","unstructured":"Haxell, P., McDonald, J.: On characterizing Vizing\u2019s edge-colouring bound. J. Graph Theory 69, 160\u2013168 (2012)","journal-title":"J. Graph Theory"},{"key":"1986_CR55","first-page":"332","volume":"24","author":"PJ Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Q. J. Pure Appl. Math. 24, 332\u2013338 (1890)","journal-title":"Q. J. Pure Appl. Math."},{"key":"1986_CR56","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. J. Comb. Math. Comb. Comput. 21, 97\u2013108 (1996)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1986_CR57","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0196-6774(86)90039-8","volume":"7","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Nishizeki, T., Shmoys, D.B.: A better than \u201cbest possible\u201d algorithm to edge color multigraphs. J. Algorithms 7, 79\u2013104 (1986)","journal-title":"J. Algorithms"},{"key":"1986_CR58","doi-asserted-by":"publisher","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":"1986_CR59","doi-asserted-by":"crossref","unstructured":"Huang, D., Wang, W.: Planar graphs of maximum degree six without seven cycles are class one. Electr. J. Comb. 19, #17 (2012)","DOI":"10.37236\/2589"},{"key":"1986_CR60","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(74)90009-0","volume":"9","author":"IT Jakobsen","year":"1974","unstructured":"Jakobsen, I.T.: On critical graphs with chromatic index 4. Discrete Math. 9, 265\u2013276 (1974)","journal-title":"Discrete Math."},{"key":"1986_CR61","unstructured":"Jakobsen, I.T.: On critical graphs with respect to edge-coloring. In: Hajnal, A., Rado, R., S\u00f3s, V. (eds.) Infinite and Finite Sets, Colloq., Keszthely, 1973 (dedicated to P. Erd\u0151s on his 60th birthday), vol.\u00a0II, Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a010, pp. 927\u2013934. North-Holland, Amsterdam (1975)"},{"key":"1986_CR62","first-page":"71","volume":"135","author":"J Jin","year":"2017","unstructured":"Jin, J., Xu, B.: Edge coloring of $$1$$ 1 -planar graphs without intersecting triangles and chordal $$5$$ 5 -cycles. ARS Comb. 135, 71\u201381 (2017)","journal-title":"ARS Comb."},{"key":"1986_CR63","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.dam.2015.07.007","volume":"200","author":"L Jin","year":"2016","unstructured":"Jin, L., Kang, Y., Steffen, E.: Remarks on planar edge-chromatic critcal graphs. Discrete Appl. Math. 200, 200\u2013202 (2016)","journal-title":"Discrete Appl. Math."},{"key":"1986_CR64","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1006\/jctb.1996.0067","volume":"68","author":"J Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotics of the chromatic index for multigraphs. J. Comb. Theory Ser. B 68, 233\u2013254 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR65","unstructured":"Kanno, J., Shan, S.: Vizing\u2019s 2-factor conjecture involving toughness and maximum degree (2017). arXiv:1709.02241v1 [math.CO] (manuscript; 5 Sep 2017)"},{"key":"1986_CR66","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0095-8956(84)90022-4","volume":"36","author":"HA Kierstead","year":"1984","unstructured":"Kierstead, H.A.: On the chromatic index of multigraphs without large triangles. J. Comb. Theory Ser. B 36, 156\u2013160 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR67","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber Graphen und ihre Anwendungen auf Determinantentheorie und Mengenlehre. Math. Ann. 77, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"key":"1986_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2014.02.021","volume":"326","author":"A Kostochka","year":"2014","unstructured":"Kostochka, A.: A new tool for proving Vizing\u2019s theorem. Discrete Math. 326, 1\u20133 (2014)","journal-title":"Discrete Math."},{"key":"1986_CR69","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2014.06.017","volume":"334","author":"X Li","year":"2014","unstructured":"Li, X., Wei, B.: Lower bounds on the number of edges in edge-chromatic critcal graphs with fixed maximum degrees. Discrete Math. 334, 1\u201312 (2014)","journal-title":"Discrete Math."},{"key":"1986_CR70","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1007\/s00373-016-1698-7","volume":"32","author":"R Luo","year":"2016","unstructured":"Luo, R., Miao, Z., Zhao, Y.: Hamiltonian cycles in critcal graphs with large maximum degree. Graphs Comb. 32, 2019\u20132028 (2016)","journal-title":"Graphs Comb."},{"key":"1986_CR71","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/jgt.21689","volume":"73","author":"R Luo","year":"2013","unstructured":"Luo, R., Zhao, Y.: A sufficient condition for edge chromatic critcal graphs to be Hamiltonian\u2014an approach to Vizing\u2019s $$2$$ 2 -factor conjecture. J. Graph Theory 73, 469\u2013482 (2013)","journal-title":"J. Graph Theory"},{"key":"1986_CR72","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1016\/j.dam.2009.01.009","volume":"158","author":"RCS Machado","year":"2010","unstructured":"Machado, R.C.S., de Figueiredo, C.M.H.: Decompositions for edge-coloring join graphs and cobipartite graphs. Discrete Appl. Math. 158, 1336\u20131342 (2010)","journal-title":"Discrete Appl. Math."},{"key":"1986_CR73","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1016\/j.disc.2013.03.020","volume":"313","author":"RCS Machado","year":"2013","unstructured":"Machado, R.C.S., de Figueiredo, C.M.H., Trotignon, N.: Edge-colouring and total colouring chordless graphs. Discrete Math. 313, 1547\u20131552 (2013)","journal-title":"Discrete Math."},{"key":"1986_CR74","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s004930100002","volume":"21","author":"O Marcotte","year":"2001","unstructured":"Marcotte, O.: Optimal edge-colorings for a class of planar multigraphs. Combinatorica 21, 361\u2013394 (2001)","journal-title":"Combinatorica"},{"key":"1986_CR75","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1002\/jgt.3190140508","volume":"14","author":"O Marcotte","year":"2001","unstructured":"Marcotte, O., Seymour, P.: Extending an edge-coloring. J. Graph Theory 14, 565\u2013573 (2001)","journal-title":"J. Graph Theory"},{"key":"1986_CR76","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/jgt.20537","volume":"68","author":"J McDonald","year":"2011","unstructured":"McDonald, J.: On a theorem of Goldberg. J. Graph Theory 68, 8\u201321 (2011)","journal-title":"J. Graph Theory"},{"key":"1986_CR77","volume-title":"Topics in Chromatic Graph Theory","author":"J McDonald","year":"2015","unstructured":"McDonald, J.: Edge-colourings. In: Beineke, L.W., Wilson, R.J. (eds.) Topics in Chromatic Graph Theory. Cambridge University Press, Cambridge (2015)"},{"key":"1986_CR78","unstructured":"McDonald, J.M., Puleo, G.J.: $$t$$ t -cores for $$\\varDelta +t$$ \u0394 + t -edge-coloring (2017). arXiv:1710.089824v1 [math.CO] (manuscript; 24 Oct 2017)"},{"key":"1986_CR79","doi-asserted-by":"publisher","first-page":"5856","DOI":"10.1016\/j.disc.2007.10.013","volume":"308","author":"L Miao","year":"2008","unstructured":"Miao, L., Pang, S.: On the size of edge-coloring critical graphs with maximum degree $$4$$ 4 . Discrete Math. 308, 5856\u20135859 (2008)","journal-title":"Discrete Math."},{"key":"1986_CR80","doi-asserted-by":"publisher","first-page":"2574","DOI":"10.1016\/j.disc.2011.06.029","volume":"311","author":"L Miao","year":"2011","unstructured":"Miao, L., Qu, J., Sun, Q.: On the average degree of critcal graphs with maximum degree six. Discrete Math. 311, 2574\u20132576 (2011)","journal-title":"Discrete Math."},{"key":"1986_CR81","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s13173-011-0046-2","volume":"18","author":"S Morais de Almeida","year":"2012","unstructured":"Morais de Almeida, S., Picinin de Mello, C., Morgana, A.: On the classification problem for split graphs. J. Braz. Comput. Soc. 18, 95\u2013101 (2012)","journal-title":"J. Braz. Comput. Soc."},{"key":"1986_CR82","unstructured":"Ni, W.-P., Wu, J.-L.: Edge coloring of planar graphs which any two short cycles are adjacent at most once. Theor. Comput. Sci. 516, 133\u2013138 (2014)"},{"key":"1986_CR83","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2013.11.011","volume":"516","author":"W-P Ni","year":"2014","unstructured":"Ni, W.-P., Wu, J.-L.: Edge coloring of planar graphs which any two short cycles are adjacent at most once. Theor. Comput. Sci. 516, 133\u2013138 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1986_CR84","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"T Nishizeki","year":"1990","unstructured":"Nishizeki, T., Kashiwagi, K.: On the 1.1-edge-coloring of multigraphs. SIAM J. Discrete Math. 3, 391\u2013410 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"1986_CR85","unstructured":"Ozeki, K.: Kempe equivalence classes of cubic graphs (2017) (Manuscript)"},{"key":"1986_CR86","doi-asserted-by":"publisher","first-page":"577","DOI":"10.7151\/dmgt.1753","volume":"34","author":"S Pang","year":"2014","unstructured":"Pang, S., Miao, L., Song, W., Miao, Z.: On the independence number of edge chromatic critical graphs. Discuss. Math. Graph Theory 34, 577\u2013584 (2014)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"166","key":"1986_CR87","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0012-365X(96)00202-6","volume":"165","author":"L Perkovi\u0107","year":"1997","unstructured":"Perkovi\u0107, L., Reed, B.: Edge coloring regular graphs of high degree. Discrete Math. 165(166), 567\u2013578 (1997)","journal-title":"Discrete Math."},{"key":"1986_CR88","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.21670","volume":"73","author":"M Plantholt","year":"2013","unstructured":"Plantholt, M.: A combined logarithmic bound on the chromatic index of multigraphs. J. Graph Theory 73, 239\u2013259 (2013)","journal-title":"J. Graph Theory"},{"key":"1986_CR89","doi-asserted-by":"crossref","unstructured":"Plantholt, M., Tipnis, S.K.: All regular multigraphs of even order and high degree are 1-factorable. Electron. J. Comb. 8, #R41 (2001)","DOI":"10.37236\/1585"},{"key":"1986_CR90","unstructured":"Puleo, G.J.: Maximal $$k$$ k -edge-colorable subgraphs, Vizing\u2019s theorem, and Tuza\u2019s conjecture (2017). arXiv:1510.07017v4 [math.CO] (manuscript; 6 Mar 2017)"},{"key":"1986_CR91","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Semin. Univ. Hambg 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Semin. Univ. Hambg"},{"key":"1986_CR92","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: The four colour theorem. J. Comb. Theory Ser. B 70, 2\u201344 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR93","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jctb.1997.1752","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Tutte\u2019s edge-colouring conjecture. J. Comb. Theory Ser. B 70, 166\u2013183 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR94","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Excluded minors in cubic graphs (2014). arXiv:1402.2118v1 [math.CO] (manuscript; 9 Mar 2014)"},{"key":"1986_CR95","doi-asserted-by":"crossref","unstructured":"Sanders, P., Steurer, D.: An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms 4, 21 (2008)","DOI":"10.1145\/1361192.1361198"},{"key":"1986_CR96","unstructured":"Sanders, D., Thomas, R.: Edge three-cubic apex graphs (2018) (manuscript in preparation)"},{"key":"1986_CR97","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"D Sanders","year":"2001","unstructured":"Sanders, D., Zhao, Y.: Planar graphs of maximum degree seven are class I. J. Comb. Theory Ser. B 83, 201\u2013212 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR98","unstructured":"Scheide, D.: Edge Colourings of Multigraphs. Doctoral thesis., TU Ilmenau, Ilmenau (2008)"},{"key":"1986_CR99","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jctb.2009.04.001","volume":"100","author":"D Scheide","year":"2010","unstructured":"Scheide, D.: Graph edge colouring: Tashkinov trees and Goldberg\u2019s conjecture. J. Comb. Theory Ser. B 100, 68\u201396 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR100","doi-asserted-by":"publisher","first-page":"4920","DOI":"10.1016\/j.disc.2008.04.046","volume":"309","author":"D Scheide","year":"2009","unstructured":"Scheide, D., Stiebitz, M.: On Vizing\u2019s bound for the chromatic index of a multigraph. Discrete Math. 309, 4920\u20134925 (2009)","journal-title":"Discrete Math."},{"key":"1986_CR101","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"1986_CR102","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1112\/plms\/s3-38.3.423","volume":"38","author":"P Seymour","year":"1979","unstructured":"Seymour, P.: On multicolorings of cubic graphs, and conjectures of Fulkerson and Tutte. Proc. Lond. Math. Soc. 38, 423\u2013460 (1979)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1986_CR103","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/S0095-8956(81)80013-5","volume":"31","author":"P Seymour","year":"1981","unstructured":"Seymour, P.: On Tutte\u2019s extension of the four-color problem. J. Comb. Theory Ser. B 31, 82\u201394 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR104","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02128672","volume":"10","author":"P Seymour","year":"1990","unstructured":"Seymour, P.: Colouring series-parallel graphs. Combinatorica 10, 379\u2013392 (1990)","journal-title":"Combinatorica"},{"key":"1986_CR105","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys. 28, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"1986_CR106","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10878-011-9420-4","volume":"25","author":"C Simone De","year":"2013","unstructured":"De Simone, C., Galluccio, A.: Edge-colouring of joins of regular graphs II. J. Comb. Optim. 25, 78\u201390 (2013)","journal-title":"J. Comb. Optim."},{"key":"1986_CR107","first-page":"153","volume":"71","author":"E Steffen","year":"2018","unstructured":"Steffen, E.: Approximating Vizing\u2019s independence number conjecture. Aust. J. Comb. 71, 153\u2013160 (2018)","journal-title":"Aust. J. Comb."},{"key":"1986_CR108","volume-title":"Graph Edge Coloring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture","author":"M Stiebitz","year":"2012","unstructured":"Stiebitz, M., Scheide, D., Toft, B., Favrholdt, L.: Graph Edge Coloring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture. Wiley, New York (2012)"},{"key":"1986_CR109","doi-asserted-by":"crossref","unstructured":"Tait, P.G.: On the colouring of maps. Proc. R. Soc. Edinb. Sect. A 10, 501\u2013503, 729 (1978\u20131980)","DOI":"10.1017\/S0370164600044229"},{"issue":"7","key":"1986_CR110","first-page":"72","volume":"1","author":"VA Tashkinov","year":"2000","unstructured":"Tashkinov, V.A.: On an algorithm for the edge coloring of multigraphs (Russian). Diskretn. Anal. Issled. Oper. Ser. 1(7), 72\u201385 (2000)","journal-title":"Diskretn. Anal. Issled. Oper. Ser."},{"key":"1986_CR111","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0021-9800(66)80004-2","volume":"23","author":"W Tutte","year":"1966","unstructured":"Tutte, W.: On the algebraic theory of graph colorings. J. Comb. Theory Ser. B 23, 15\u201350 (1966)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1986_CR112","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF01787705","volume":"6","author":"Z Tuza","year":"1990","unstructured":"Tuza, Z.: A conjecture on triangles of graphs. Graphs Comb. 6, 373\u2013380 (1990)","journal-title":"Graphs Comb."},{"key":"1986_CR113","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/jgt.21629","volume":"72","author":"ER Vaughan","year":"2013","unstructured":"Vaughan, E.R.: An asymptotic version of the multigraph $$1$$ 1 -factorization conjecture. J. Graph Theory 72, 19\u201329 (2013)","journal-title":"J. Graph Theory"},{"key":"1986_CR114","unstructured":"Vizing, V.G.:. On an estimate of the chromatic class of a $$p$$ p -graph (Russian). Diskret. Anal.3, 25\u201330 (1964) [English translation in (108, App. A1)]"},{"key":"1986_CR115","unstructured":"Vizing, V.G.: The chromatic class of a multigraph (Russian). Kibernetika (Kiev) 3, 29\u201339 (1965) [English translation in: Cybernetics and System Analysis 1, 32\u201341 (1965)]"},{"key":"1986_CR116","unstructured":"Vizing, V.G.: Critical graphs with a given chromatic class (Russian). Diskret. Anal. 5, 9\u201317 (1965) [English translation in (108, App. A1)]"},{"key":"1986_CR117","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory (Russian). Uspekhi Mat. Nauk 23, 117\u2013134 (1968) [English translation in: Russian Mathematical Surveys 23, 125\u2013141 (1968)]"},{"key":"1986_CR118","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10255-017-0693-y","volume":"33","author":"Y Wang","year":"2017","unstructured":"Wang, Y.: Edge coloring of graphs embedded in a surface of negative characteristic. Acta Math. Appl. Sin. Engl. Ser. 33, 709\u2013716 (2017)","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"key":"1986_CR119","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.dam.2012.08.011","volume":"161","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Xu, L.: A sufficient condition for a plane graph with maximum degree 6 to be class $$1$$ 1 . Discrete Appl. Math. 161, 307\u2013310 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1986_CR120","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/jgt.20259","volume":"56","author":"DR Woodall","year":"2007","unstructured":"Woodall, D.R.: The average degree of an edge-chromatic critical graph II. J. Graph Theory 56, 194\u2013218 (2007)","journal-title":"J. Graph Theory"},{"key":"1986_CR121","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/jgt.20493","volume":"66","author":"DR Woodall","year":"2011","unstructured":"Woodall, D.R.: The independence number of an edge-chromatic critical graph. J. Graph Theory 66, 98\u2013103 (2011)","journal-title":"J. Graph Theory"},{"key":"1986_CR122","unstructured":"Woodall, D.R.: Edge-chromatic 3-critical graphs have more edges (2018) (Manuscript)"},{"key":"1986_CR123","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2013.07.027","volume":"518","author":"J-L Wu","year":"2014","unstructured":"Wu, J.-L., Xue, L.: Edge colorings of planar graphs without $$5$$ 5 -cycles with two chords. Theor. Comput. Sci. 518, 124\u2013127 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1986_CR124","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s003730070009","volume":"16","author":"L Zhang","year":"2000","unstructured":"Zhang, L.: Every planar graph with maximum degree 7 is class I. Graphs Comb. 16, 467\u2013495 (2000)","journal-title":"Graphs Comb."},{"key":"1986_CR125","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2014.11.031","volume":"566","author":"W Zhang","year":"2015","unstructured":"Zhang, W., Wu, J.-L.: Some sufficient conditions for $$1$$ 1 -planar graphs to be class $$1$$ 1 . Theor. Comput. Sci. 566, 50\u201358 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1986_CR126","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2018.05.006","volume":"739","author":"W Zhang","year":"2018","unstructured":"Zhang, W., Wu, J.-L.: Edge coloring of planar graph without adjacent $$7$$ 7 -cycles. Theor. Comput. Sci. 739, 59\u201364 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"1986_CR127","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/j.disc.2015.12.009","volume":"339","author":"X Zhang","year":"2016","unstructured":"Zhang, X.: The edge chromatic number of outer- $$1$$ 1 -planar graphs. Discrete Math. 339, 1393\u20131399 (2016)","journal-title":"Discrete Math."},{"key":"1986_CR128","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ipl.2011.10.021","volume":"112","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Liu, G.: On edge colorings $$1$$ 1 -planar graphs without adjacent triangles. Inf. Process. Lett. 112, 138\u2013142 (2012)","journal-title":"Inf. Process. Lett."},{"key":"1986_CR129","first-page":"431","volume":"104","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Liu, G.: On edge colorings $$1$$ 1 -planar graphs without chordal $$5$$ 5 -cycles. ARS Comb. 104, 431\u2013436 (2012)","journal-title":"ARS Comb."},{"key":"1986_CR130","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ipl.2010.11.001","volume":"111","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Wu, J.-L.: On edge colorings $$1$$ 1 -planar graphs. Inf. Process. Lett. 111, 124\u2013128 (2011)","journal-title":"Inf. Process. Lett."},{"key":"1986_CR131","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2016.10.022","volume":"245","author":"A Zorzi","year":"2018","unstructured":"Zorzi, A., Zatesko, L.M.: On the chromatic index of join graphs and triangle-free graphs with large maximum degree. Discrete Appl. Math. 245, 183\u2013189 (2018)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1986-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1986-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1986-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T15:16:32Z","timestamp":1605971792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1986-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":131,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1986"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1986-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"14 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}