{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:29Z","timestamp":1740122369943,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T00:00:00Z","timestamp":1483574400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Shandong Provincial Natural Science Foundation, China","award":["ZR2014JL001"],"award-info":[{"award-number":["ZR2014JL001"]}]},{"name":"Shandong Province Higher Educational Science and Technology Program (China)","award":["J13LI04"],"award-info":[{"award-number":["J13LI04"]}]},{"name":"Excellent Young Scholars Research Fund of Shandong Normal University of China"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10878-016-0108-7","type":"journal-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T07:51:42Z","timestamp":1483602702000},"page":"771-780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Disconnected $$g_c$$ g c -critical graphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6323-2923","authenticated-orcid":false,"given":"Xia","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,5]]},"reference":[{"key":"108_CR1","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1090\/S0002-9904-1974-13468-3","volume":"80","author":"RP Gupta","year":"1974","unstructured":"Gupta RP (1974) On decompositions of a multigraph into spanning subgraphs. Bull Am Math Soc 80:500\u2013502","journal-title":"Bull Am Math Soc"},{"issue":"4","key":"108_CR2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer I (1981) The $$NP$$ N P -completeness of edge colorings. SIAM J Comput 10(4):718\u2013720","journal-title":"SIAM J Comput"},{"issue":"2","key":"108_CR3","first-page":"247","volume":"34","author":"J Li","year":"2011","unstructured":"Li J, Liu G (2011a) On $$f$$ f -edge cover coloring of nearly bipartite graphs. Bull Malays Math Sci Soc (2) 34(2):247\u2013253","journal-title":"Bull Malays Math Sci Soc (2)"},{"key":"108_CR4","first-page":"65","volume":"84","author":"J Li","year":"2011","unstructured":"Li J, Liu G (2011b) On $$f$$ f -edge cover-coloring of regular graphs. Util Math 84:65\u201373","journal-title":"Util Math"},{"key":"108_CR5","first-page":"3","volume":"83","author":"J Li","year":"2012","unstructured":"Li J, Liu G (2012) On $$f$$ f -edge covered critical graphs. J Comb Math Comb Comput 83:3\u201311","journal-title":"J Comb Math Comb Comput"},{"issue":"10","key":"108_CR6","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1007\/s10114-016-5519-y","volume":"32","author":"H Ma","year":"2016","unstructured":"Ma H, Zhang X (2016) Some class 1 graphs on gc-colorings. Acta Math Sin Engl Ser 32(10):1237\u20131245","journal-title":"Acta Math Sin Engl Ser"},{"issue":"1","key":"108_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0252-9602(17)30271-0","volume":"25B","author":"H Song","year":"2005","unstructured":"Song H, Liu G (2005) On $$f$$ f -edge cover-coloring of simple graphs. Acta Math Sci 25B(1):145\u2013151","journal-title":"Acta Math Sci"},{"key":"108_CR8","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a $$p$$ p -graph. Diskret Anal 3:25\u201330 (Russian)","journal-title":"Diskret Anal"},{"key":"108_CR9","first-page":"9","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing VG (1965) Critical graphs with a given chromatic class. Diskret Anal 5:9\u201317 (Russian)","journal-title":"Diskret Anal"},{"issue":"1\u20132","key":"108_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02832324","volume":"24","author":"J Wang","year":"2007","unstructured":"Wang J, Hou J, Liu G (2007a) Some properties on $$f$$ f -edge covered critical graphs. J Appl Math Comput 24(1\u20132):357\u2013366","journal-title":"J Appl Math Comput"},{"key":"108_CR11","doi-asserted-by":"crossref","unstructured":"Wang J, Zhang S, Hou J (2007b) On $$f$$ f -edge cover-coloring of simple graphs. In: 7th international conference on computational science (ICCS 2007), Beijing, China, 27\u201330 May, Part III, LNCS 4489, pp 448\u2013452","DOI":"10.1007\/978-3-540-72588-6_73"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0108-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0108-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0108-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T01:21:04Z","timestamp":1568683264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0108-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["108"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0108-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,1,5]]}}}